Computational Optimization and Applications

2006 - 2025

Current editor(s): William W. Hager

From Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().

Access Statistics for this journal.
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 92, issue 1, 2025

A randomized feasible algorithm for optimization with orthogonal constraints pp. 1-27

Fan Fei, Yuchen Feng and Jinyan Fan

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians pp. 29-79

Chenyu Zhang and Rujun Jiang

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization pp. 81-123

Francesco Carciaghi, Simone Magistri, Pierluigi Mansueto and Fabio Schoen

The cosine measure relative to a subspace pp. 125-153

Charles Audet, Warren Hare and Gabriel Jarry-Bolduc

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems pp. 155-178

Jian Chen, Liping Tang and Xinmin Yang

Cardinality objective nonlinear programs for facility capacity expansion pp. 179-214

Gao-Xi Li and Xin-Min Yang

Preprocessing and valid inequalities for exact detection of critical nodes via integer programming pp. 215-263

Sheng-Jie Chen, Liang Chen, Guang-Ming Li and Yu-Hong Dai

A sequence-form differentiable path-following method to compute Nash equilibria pp. 265-300

Yuqing Hou, Yiyin Cao, Chuangyin Dang and Yong Wang

Adaptive cyclic gradient methods with interpolation pp. 301-325

Yixin Xie, Cong Sun and Ya-Xiang Yuan

A unified approach for smoothing approximations to the exact $$\ell _1$$ ℓ 1 -penalty for inequality-constrained optimization pp. 327-344

Mariana da Rosa, Ademir Alves Ribeiro and Elizabeth Wegner Karas

A general preconditioner for a class of vertical tensor complementarity problems pp. 345-373

Shi-Liang Wu, Mei Long and Cui-Xia Li

Volume 91, issue 3, 2025

A multi-precision quadratic regularization method for unconstrained optimization with rounding error analysis pp. 997-1031

Dominique Monnet and Dominique Orban

Second order shape optimization for an interface identification problem constrained by nonlocal models pp. 1033-1071

Matthias Schuster and Volker Schulz

A flexible gradient tracking algorithmic framework for decentralized optimization pp. 1073-1104

Albert S. Berahas, Raghu Bollapragada and Shagun Gupta

Convergence analysis of a mixed logarithmic barrier-augmented Lagrangian algorithm without constraint qualification pp. 1105-1134

Tran Ngoc Nguyen

Riemannian optimization using three different metrics for Hermitian PSD fixed-rank constraints pp. 1135-1184

Shixin Zheng, Wen Huang, Bart Vandereycken and Xiangxiong Zhang

An extended sequential quadratic method with extrapolation pp. 1185-1225

Yongle Zhang, Ting Kei Pong and Shiqi Xu

Convergence rate of inexact augmented Lagrangian method with practical relative error criterion for composite convex programming pp. 1227-1261

Yunfei Qu, Xingju Cai, Hongying Liu and Deren Han

On the forward–backward method with nonmonotone linesearch for infinite-dimensional nonsmooth nonconvex problems pp. 1263-1308

Behzad Azmi and Marco Bernreuther

Adaptive dipole-like parameter calibration of complex black-box continuous processes pp. 1309-1338

Avi Herbon, Mauro Gaggero, Eugene Khmelnitsky and Marcello Sanguineti

An efficient global optimization algorithm for the sum of linear ratios problems based on a novel adjustable branching rule pp. 1339-1371

Bingdi Huang and Peiping Shen

Inner $$\delta $$ δ -approximation of the convex hull of finite sets pp. 1373-1413

Nam-Dũng Hoang, Nguyen Kieu Linh and Hoang Xuan Phu

Correction: Regularized methods via cubic model subspace minimization for nonconvex optimization pp. 1415-1416

Stefania Bellavia, Davide Palitta, Margherita Porcelli and Valeria Simoncini

Volume 91, issue 2, 2025

Preface: New trends in large scale optimization pp. 351-356

Stefania Bellavia, Valentina Simone and Benedetta Morini

A nested primal–dual iterated Tikhonov method for regularized convex optimization pp. 357-395

Stefano Aleotti, Silvia Bonettini, Marco Donatelli, Marco Prato and Simone Rebegoldi

Strong global convergence properties of algorithms for nonlinear symmetric cone programming pp. 397-421

R. Andreani, G. Haeser, A. Ramos, D. O. Santos, L. D. Secchin and A. Serranoni

Spectral analysis of block preconditioners for double saddle-point linear systems with application to PDE-constrained optimization pp. 423-455

Luca Bergamaschi, Ángeles Martínez, John W. Pearson and Andreas Potschka

A general framework for whiteness-based parameters selection in variational models pp. 457-489

Francesca Bevilacqua, Alessandro Lanza, Monica Pragliola and Fiorella Sgallari

Safeguarded augmented Lagrangian algorithms with scaled stopping criterion for the subproblems pp. 491-509

E. G. Birgin, G. Haeser and J. M. Martínez

Projection free methods on product domains pp. 511-540

Immanuel Bomze, Francesco Rinaldi and Damiano Zeffiro

Distributed Tikhonov regularization for ill-posed inverse problems from a Bayesian perspective pp. 541-572

D. Calvetti and E. Somersalo

Proximal-stabilized semidefinite programming pp. 573-616

Stefano Cipolla and Jacek Gondzio

Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton–Krylov methods pp. 617-647

Giovanni Fasano, Christian Piermarini and Massimo Roma

Polynomial worst-case iteration complexity of quasi-Newton primal-dual interior point algorithms for linear programming pp. 649-681

Jacek Gondzio and Francisco N. C. Sobral

Distributed inexact Newton method with adaptive step sizes pp. 683-715

Dušan Jakovetić, Nataša Krejić and Greta Malaspina

Spectral stochastic gradient method with additional sampling for finite and infinite sums pp. 717-758

Nataša Krklec Jerinkić, Valeria Ruggiero and Ilaria Trombini

A Scaled Gradient Projection method for the realization of the balancing principle in TGV-based image restoration pp. 759-785

Germana Landi, Marco Viola and Fabiana Zama

Variational graph p-Laplacian eigendecomposition under p-orthogonality constraints pp. 787-825

Alessandro Lanza, Serena Morigi and Giuseppe Recupero

Off-the-grid regularisation for Poisson inverse problems pp. 827-860

Marta Lazzaretti, Claudio Estatico, Alejandro Melero and Luca Calatroni

The indefinite proximal gradient method pp. 861-903

Geoffroy Leconte and Dominique Orban

Truncated LSQR for matrix least squares problems pp. 905-932

Lorenzo Piccinini and Valeria Simoncini

Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness pp. 933-971

Ruggiero Seccia, Corrado Coppola, Giampaolo Liuzzi and Laura Palagi

Convergence of a quasi-Newton method for solving systems of nonlinear underdetermined equations pp. 973-996

N. Vater and A. Borzì

Volume 91, issue 1, 2025

A symmetric version of the generalized Chambolle-Pock-He-Yuan method for saddle point problems pp. 1-26

Feng Ma, Si Li and Xiayang Zhang

Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients pp. 27-66

Xiaopeng Zhao, Ravi Raushan, Debdas Ghosh, Jen-Chih Yao and Min Qi

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization pp. 67-124

Helmut Gfrerer

Quadratic convex reformulations for a class of complex quadratic programming problems pp. 125-144

Cheng Lu, Gaojian Kang, Guangtai Qu and Zhibin Deng

Finding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty pp. 145-171

Shen Peng, Gianpiero Canessa, David Ek and Anders Forsgren

On a family of relaxed gradient descent methods for strictly convex quadratic minimization pp. 173-200

Liam MacDonald, Rua Murray and Rachael Tappenden

Inertial accelerated stochastic mirror descent for large-scale generalized tensor CP decomposition pp. 201-233

Zehui Liu, Qingsong Wang, Chunfeng Cui and Yong Xia

The $$\omega $$ ω -condition number: applications to preconditioning and low rank generalized Jacobian updating pp. 235-282

Woosuk L. Jung, David Torregrosa-Belén and Henry Wolkowicz

Speeding up L-BFGS by direct approximation of the inverse Hessian matrix pp. 283-310

Ashkan Sadeghi-Lotfabadi and Kamaledin Ghiasi-Shirazi

On the well-posedness of tracking Dirichlet data for Bernoulli free boundary problems pp. 311-349

Wei Gong and Le Liu