Computational Optimization and Applications

2006 - 2026

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 93, issue 2, 2026

Active set-based inexact proximal bundle algorithm for stochastic quadratic programming pp. 489-521

Niloofar Fadavi and Harsha Gangammanavar

An overview and comparison of spectral bundle methods for primal and dual semidefinite programs pp. 523-566

Feng-Yi Liao, Lijun Ding and Yang Zheng

Error bounds and Newton-type methods for reformulations of Karush–Kuhn–Tucker systems of mathematical programs with complementarity constraints pp. 567-599

Andreas Fischer, Alexey F. Izmailov, Maik Punke and Zhibai Yan

Transformations of variables and transformations of equations via the perturbed Newton method framework pp. 601-616

Alexey F. Izmailov and Mikhail V. Solodov

Global convergence analysis of the power proximal point and augmented Lagrangian method pp. 617-649

Konstantinos A. Oikonomidis, Alexander Bodard, Emanuel Laude and Panagiotis Patrinos

Symplectic discretization approach for developing new proximal point algorithm pp. 651-687

Ya-xiang Yuan and Yi Zhang

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints pp. 689-727

Lahcen El Bourkhissi and Ion Necoara

A general framework for inexact splitting algorithms with relative errors and applications to Chambolle–Pock and Davis–Yin methods pp. 729-763

M. Marques Alves, Dirk A. Lorenz and Emanuele Naldi

Extrapolated hard thresholding algorithms with finite length for composite $$\ell _0$$ penalized problems pp. 765-794

Fan Wu, Jiazhen Wei and Wei Bian

A globally convergent gradient method with momentum pp. 795-820

Matteo Lapucci, Giampaolo Liuzzi, Stefano Lucidi, Davide Pucci and Marco Sciandrone

A shape optimization approach for a Batchelor flow problem pp. 821-850

Henry Kasumba

A simple and effective exact method for the medianoid problem with multipurpose trips pp. 851-897

Juan Pablo Fernández-Gutiérrez, Juan G. Villegas and José-Fernando Camacho-Vallejo

Volume 93, issue 1, 2026

A globalized inexact semismooth Newton method for nonsmooth fixed-point equations involving variational inequalities pp. 1-55

Amal Alphonse, Constantin Christof, Michael Hintermüller and Ioannis P. A. Papadopoulos

Probabilistic iterative hard thresholding for sparse learning pp. 57-83

Matteo Bergamaschi, Andrea Cristofari, Vyacheslav Kungurtsev and Francesco Rinaldi

prunAdag: an adaptive pruning-aware gradient method pp. 85-119

Margherita Porcelli, Giovanni Seraghiti and Philippe L. Toint

Accelerated forward-backward algorithms with subgradient corrections pp. 121-156

Xin He and Yaping Fang

Variable metric proximal stochastic gradient methods with additional sampling pp. 157-207

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

Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach pp. 209-265

Giacomo Cristinelli, José A. Iglesias and Daniel Walter

A heuristic algorithm for the cluster editing problem pp. 267-301

Keisuke Murakami and Takeaki Uno

Behavioral portfolio optimization via cumulative prospect theory with a symmetric alternating direction method of multipliers pp. 303-334

Zhongming Wu, Liu Yang and Valentina De Simone

A novel global algorithm for optimal portfolio selection with maximum relative marginal risk via SCO method and SOCP relaxation pp. 335-372

Hezhi Luo, Tianxing Gou, Huixian Wu and Qian Li

A reconsideration of quasimonotone variational inequality problems pp. 373-395

Meiying Wang, Hongwei Liu and Jun Yang

Formulations and algorithms for the simple cycle problem pp. 397-433

Abilio Lucena, Luidi Simonetti and Alexandre Salles da Cunha

An overview of absolute value equations: from theory to solution methods and challenges pp. 435-488

Milan Hladík, Hossein Moosaei, Fakhrodin Hashemi, Saeed Ketabchi and Panos M. Pardalos

Volume 92, issue 3, 2025

Preface: global optimization algorithms and applications pp. 755-760

Vladimir Boginski, Alla Kammerdiner, Pavlo Krokhmal and Alexander Semenov

Learning to accelerate tightening of convex relaxations of the AC optimal power flow problem pp. 761-786

Fatih Cengil, Harsha Nagarajan, Russell Bent, Sandra Eksioglu and Burak Eksioglu

A two-stage stochastic programming approach for generation and transmission maintenance scheduling with risk management pp. 787-809

Aoyu Fan, Zhouchun Huang, Qipeng Zheng and Xiaodong Luo

A new and faster representation for counting integer points in parametric polyhedra pp. 811-861

Dmitry V. Gribanov, Dmitry S. Malyshev, Panos M. Pardalos and Nikolai Yu. Zolotykh

New biconvex optimization for planning of battery energy storage systems pp. 863-887

Ang Li, Jiming Peng and Lei Fan

Model-and-search: a derivative-free local optimization algorithm pp. 889-921

Kaiwen Ma, Luis Miguel Rios, Hua Zheng, Nikolaos V. Sahinidis and Sreekanth Rajagopalan

Regularized standard polynomial programming formulations for the maximum clique problem pp. 923-949

Mykyta Makovenko, Sergiy Butenko and Miltiades Pardalos

Error control and Neyman–Pearson classification with buffered probability and support vectors pp. 951-985

Matthew Norton, Liting Chiang and Stan Uryasev

Two-commodity opposite direction network flow formulations for the travelling salesman problem pp. 987-1033

Konstantin Pavlikov and Niels Christian Petersen

Bounding-focused discretization methods for the global optimization of nonconvex semi-infinite programs pp. 1035-1068

Evren M. Turan, Johannes Jäschke and Rohit Kannan

Ultra-small world detection in networks: subgraphs with prescribed distance distributions pp. 1069-1121

Alexander Veremyev, Vladimir Boginski, Eduardo L. Pasiliao and Oleg A. Prokopyev

Solving continuous and discrete nonlinear programs with BARON pp. 1123-1161

Yi Zhang and Nikolaos V. Sahinidis

Volume 92, issue 2, 2025

Risk-averse constrained blackbox optimization under mixed aleatory/epistemic uncertainties pp. 375-435

Charles Audet, Jean Bigeon, Romain Couderc and Michael Kokkolaras

A proximal gradient method with an explicit line search for multiobjective optimization pp. 437-469

Y. Bello-Cruz, J. G. Melo, L. F. Prudente and R. V. G. Serra

Treatment learning with Gini constraints by Heaviside composite optimization and a progressive method pp. 471-513

Yue Fang, Junyi Liu and Jong-Shi Pang

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$ pp. 515-527

S. Gratton, C.-K. Sim and Ph. L. Toint

An alternating algorithm for structure preserving CP-decompositions of partially symmetric tensors pp. 529-561

Jie Ni, Yuhong Dai and Zheng Peng

Efficient training of Gaussian processes with tensor product structure pp. 563-587

Josie Koenig, Max Pfeffer and Martin Stoll

A new dual spectral projected gradient method for log-determinant semidefinite programming with hidden clustering structures pp. 589-615

Charles Namchaisiri, Tianxiang Liu and Makoto Yamashita

Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model pp. 617-653

Ting Tao, Yitian Qian and Shaohua Pan

The Capacitated Vehicle Routing Problem with Planned Downtime pp. 655-681

Mercedes Landete, Marina Leal, Juan Francisco Monge and Inmaculada Rodríguez-Martín

Improved Gauss-Seidel type and Jacobi type methods for linear complementarity problems pp. 683-708

Wentai Liu, Yong Wang and Zheng-Hai Huang

On the robust isolated calmness of a class of nonsmooth optimizations on Riemannian manifolds and its applications pp. 709-754

Chenglong Bao, Chao Ding and Yuexin Zhou

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