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 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

Volume 90, issue 3, 2025

Inter-DS: a cost saving algorithm for expensive constrained multi-fidelity blackbox optimization pp. 607-629

Stéphane Alarie, Charles Audet, Miguel Diago, Sébastien Le Digabel and Xavier Lebeuf

Cardinality constrained mean-variance portfolios: a penalty decomposition algorithm pp. 631-648

Ahmad Mousavi and George Michailidis

Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm pp. 649-689

Christoph Buchheim, Alexandra Grütering and Christian Meyer

On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination pp. 691-720

Peter Kirst and Christian Füllner

All saddle points for polynomial optimization pp. 721-752

Anwa Zhou, Shiqian Yin and Jinyan Fan

On the convergence of the gradient descent method with stochastic fixed-point rounding errors under the Polyak–Łojasiewicz inequality pp. 753-799

Lu Xia, Stefano Massei and Michiel E. Hochstenbach

Regularized methods via cubic model subspace minimization for nonconvex optimization pp. 801-837

Stefania Bellavia, Davide Palitta, Margherita Porcelli and Valeria Simoncini

A convex combined symmetric alternating direction method of multipliers for separable optimization pp. 839-880

Xiaoquan Wang, Hu Shao and Ting Wu

Understanding the Douglas–Rachford splitting method through the lenses of Moreau-type envelopes pp. 881-910

Felipe Atenas

A second-order sequential optimality condition for nonlinear second-order cone programming problems pp. 911-939

Ellen H. Fukuda and Kosuke Okabe

Improving the stochastically controlled stochastic gradient method by the bandwidth-based stepsize pp. 941-968

Chenchen Liu, Yakui Huang and Dan Wang

An arc-search interior-point algorithm for nonlinear constrained optimization pp. 969-995

Yaguang Yang

Volume 90, issue 2, 2025

A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials pp. 337-360

Ryan H. Vogt, Sven Leyffer and Todd Munson

Solving polynomial variational inequality problems via Lagrange multiplier expressions and Moment-SOS relaxations pp. 361-394

Jiawang Nie, Defeng Sun, Xindong Tang and Min Zhang

Adversarial perturbations of physical signals pp. 395-415

Robert L. Bassett, Austin Dellen and Anthony P. Austin

Convergence of a stochastic variance reduced Levenberg–Marquardt method pp. 417-444

Weiyi Shao and Jinyan Fan

An inexact ADMM for separable nonconvex and nonsmooth optimization pp. 445-479

Jianchao Bai, Miao Zhang and Hongchao Zhang

Convergence analysis for a nonlocal gradient descent method via directional Gaussian smoothing pp. 481-513

Hoang Tran, Qiang Du and Guannan Zhang

Rank-one approximation of a higher-order tensor by a Riemannian trust-region method pp. 515-556

Jianheng Chen and Wen Huang

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems pp. 557-582

Huiling Zhang and Zi Xu

A branch-and-price algorithm for the hyper-rectangular clustering problem with axis-parallel clusters and outliers pp. 583-605

Diego Delle Donne and Javier Marenco

Volume 90, issue 1, 2025

Optimization schemes on manifolds for structured matrices with fixed eigenvalues pp. 1-26

Jean-Paul Chehab, Harry Oviedo and Marcos Raydan

Generating representative sets for multiobjective discrete optimization problems with specified coverage errors pp. 27-51

Gokhan Kirlik and Serpil Sayın

A real moment-HSOS hierarchy for complex polynomial optimization with real coefficients pp. 53-75

Jie Wang and Victor Magron

The sparse(st) optimization problem: reformulations, optimality, stationarity, and numerical results pp. 77-112

Christian Kanzow, Alexandra Schwartz and Felix Weiß

Solving convex optimization problems via a second order dynamical system with implicit Hessian damping and Tikhonov regularization pp. 113-149

Szilárd Csaba László

Fast convergence of the primal-dual dynamical system and corresponding algorithms for a nonsmooth bilinearly coupled saddle point problem pp. 151-192

Ke-wei Ding, Jörg Fliege and Phan Tu Vuong

Efficient proximal subproblem solvers for a nonsmooth trust-region method pp. 193-226

Robert J. Baraldi and Drew P. Kouri

Approximate bregman proximal gradient algorithm for relatively smooth nonconvex optimization pp. 227-256

Shota Takahashi and Akiko Takeda

A New branch-and-cut algorithm for linear sum-of-ratios problem based on SLO method and LO relaxation pp. 257-301

Hezhi Luo, Youmin Xu, Huixian Wu and Guoqiang Wang

On a minimization problem of the maximum generalized eigenvalue: properties and algorithms pp. 303-336

Akatsuki Nishioka, Mitsuru Toyoda, Mirai Tanaka and Yoshihiro Kanno