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

A nonsmooth Riemannian trust-region method for multiobjective optimization with applications in machine learning problems pp. 485-522

Nima Eslami, Amir Ardestani-Jaafari and Javad Tavakoli

Enhancing boundary optimality in constrained Bayesian optimization via exterior barrier functions pp. 523-562

Sihyeong Lim and Philipp Bekemeyer

Estimating lower bound functions in surrogate optimization pp. 563-607

Mohammadsina Almasi, Hadis Anahideh and Jay M. Rosenberger

Joint lot-sizing and energy supply planning under renewable energy uncertainty pp. 609-650

Ruiwen Liao, Franco Quezada, Céline Gicquel and Safia Kedad-Sidhoum

Averaged proximal reflected gradient method for monotone variational inequalities pp. 651-677

Xiaokai Chang, Jialin Li and Jun Yang

Adaptive open-loop step-sizes for accelerated convergence rates of the Frank–Wolfe algorithm pp. 679-698

Elias Wirth, Javier Peña and Sebastian Pokutta

A variable smoothing for weakly convex composite minimization with manifold constraint via parametrization pp. 699-747

Keita Kume and Isao Yamada

A note on the gradient-evaluation sequence in accelerated gradient methods pp. 749-775

Yan Wu, Yipeng Zhang, Lu Liu and Yuyuan Ouyang

Spingarn’s method and progressive decoupling beyond elicitable monotonicity pp. 777-817

Brecht Evens, Puya Latafat and Panagiotis Patrinos

An outer approximation-Benders’ decomposition approach for the competitive facility location problem with limited choice rule pp. 819-874

Thalles V. F. Mota, Ricardo Saraiva de Camargo, Gilberto de Miranda and Fátima Machado de Souza Lima

Solving cyclic antibandwidth problem by SAT pp. 875-923

Hieu Truong Xuan and Khanh To Van

Quantum genetic evolutionary algorithm for discrete and continuous optimization on quantum–classical hybrid computing architectures pp. 925-947

Zhenghuan Wang and Xiaojun Wang

Volume 95, issue 1, 2026

Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm pp. 1-28

Marianna De Santis, Gabriele Eichfelder and Margherita Porcelli

An inexact alternating projection method with application to matrix completion pp. 29-74

Stefania Bellavia, Simone Rebegoldi and Mattia Silei

An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints pp. 75-129

Yonggang Pei, Jingyi Guo and Detong Zhu

Bayesian optimization by kernel regression and density-based exploration pp. 131-184

Tansheng Zhu, Hongyu Zhou, Ke Jin, Xusheng Xu, Qiufan Yuan and Lijie Ji

A nonmonotone front descent method for bound-constrained multi-objective optimization pp. 185-213

Pierluigi Mansueto

Local convergence of the Gauss–Newton methods for constrained nonlinear equations pp. 215-238

Alexey F. Izmailov and Mikhail V. Solodov

An inexact variable metric proximal linearization method for composite optimization on manifolds pp. 239-289

Hao He, Ruyu Liu, Yitian Qian and Shaohua Pan

High-resolution inertial dynamics with time-rescaled gradients for nonsmooth convex optimization pp. 291-340

Manh Hung Le and Andrea Simonetto

Shape optimization constrained by time-dependent Stokes flow: modeling, analysis and numerical simulation pp. 341-390

Jiajie Li, Wan Li and Shengfeng Zhu

Robust stochastic optimal control via variance penalization: application to energy management systems pp. 391-412

Paul Malisani, Adrien Spagnol and Vivien Smis-Michel

The quadratic multidimensional knapsack problem: exact, heuristic, and machine learning methods pp. 413-445

Richard J. Forrester and Lucas A. Waddell

Restrictive metric regularity of set-valued mappings and applications to the Newton’s method for generalized equations pp. 447-480

Nguyen Van Vu and Huynh Van Ngai

Correction: A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems pp. 481-483

Dongmei Yu, Huiling Wei, Cairong Chen and Deren Han

Volume 94, issue 3, 2026

A natural SQP method with potentially infeasible subproblems for nonlinear optimization pp. 811-849

Wenhao Fu and Yu-Hong Dai

Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant pp. 851-905

Ngoc Hoang Anh Mai, Victor Magron, Jean-Bernard Lasserre and Kim-Chuan Toh

A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds pp. 907-947

Chunming Tang, Shajie Xing, Wen Huang and Jinbao Jian

Accelerated nonnegative proximal gradient algorithm for sparse linear complementarity problem pp. 949-972

Xinlin Hu and Kai Zhang

A derivative-free Levenberg–Marquardt method for sparse nonlinear least squares problems pp. 973-997

Yuchen Feng, Chuanlong Wang and Jinyan Fan

Constraint hypergraph partitioning problems via recursive bipartition algorithm based on improved Dai–Kou conjugate gradient algorithm pp. 999-1040

Yingying Li, Zexian Liu, Yongqiang Yao and Hongwei Liu

Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence pp. 1041-1084

Patrick Mehlitz

A more efficient reformulation of complex SDP as real SDP pp. 1085-1101

Jie Wang

A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems pp. 1103-1143

Dongmei Yu, Huiling Wei, Cairong Chen and Deren Han

Forward–backward splitting in bilaterally bounded Alexandrov spaces pp. 1145-1185

Heikki von Koch and Tuomo Valkonen

An efficient linearization approach for project portfolio selection problems considering project interdependencies pp. 1187-1226

Jung-Fa Tsai and Ming-Hua Lin

A new adaptive algorithm for competitive group testing pp. 1227-1271

Jun Wu, Yongxi Cheng, Zhen Yang, Feng Chu and Junkai He

Volume 94, issue 2, 2026

Scalable approximate optimal diagonal preconditioning pp. 439-473

Wenzhi Gao, Zhaonan Qu, Madeleine Udell and Yinyu Ye

Parallel block coordinate descent methods with identification strategies pp. 475-508

Ronaldo Lopes, Sandra A. Santos and Paulo J. S. Silva

A speed up strategy for gradient methods pp. 509-541

Anna De Magistris, Serena Crisci, Valentina De Simone and Gerardo Toraldo

Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems pp. 543-569

Matteo Lapucci and Davide Pucci

Efficient gradient tracking algorithms for distributed optimization problems with inexact communication pp. 571-612

Shengchao Zhao and Yongchao Liu

General inertial proximal gradient method with gradient extrapolation for nonconvex nonsmooth optimization problems pp. 613-648

Tanxing Wang, Xingju Cai, Yongzhong Song and Bo Jiang

Structured nonsmooth optimization using functional encoding and branching information pp. 649-704

Fengqiao Luo

A second-order descent method with active-set prediction for group-sparse optimization pp. 705-745

J.C. De los Reyes, S. López-Ordóñez and P. Merino

Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time pp. 747-780

Tanmaya Karmarkar and Yves Lucet

Subgradient-based tableau pivot method for sparse signal recovery pp. 781-810

Xiao-Li Hu, Xiaoyong Xiao, Yulong Huang and Jiajun Wen

Volume 94, issue 1, 2026

Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm pp. 1-37

Albert S. Berahas, Raghu Bollapragada and Wanping Dong

Correction: Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm pp. 39-39

Albert S. Berahas, Raghu Bollapragada and Wanping Dong

Verifying Robustness of Neural Networks with Tight Semidefinite Relaxations pp. 41-72

Godai Azuma, Sunyoung Kim and Makoto Yamashita

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization pp. 73-110

Hanfeng Zeng, Wenqing Ouyang and Andre Milzarek

A symmetric primal-dual method with double extrapolation for composite convex optimization involving three functions pp. 111-140

Lihan Zhou and Feng Ma

Revisiting Extragradient-Type Methods: Part 1—Generalizations and Sublinear Convergence Rates pp. 141-210

Quoc Tran-Dinh and Nghia Nguyen-Trung

An improved convergence guarantee for the gradient-push algorithm with a constant stepsize pp. 211-248

Hyogi Choi, Woocheol Choi and Gwangil Kim

Shape and topology optimization for elasticity system using shape gradients and topological derivatives pp. 249-277

Yixin Tan and Jan Sokolowski

Domain decomposition for entropic unbalanced optimal transport pp. 279-315

Ismael Medina, The Sang Nguyen and Bernhard Schmitzer

FIRM: federated image reconstruction using multimodal tomographic data pp. 317-352

Geunyeong Byeon, Minseok Ryu, Zichao Wendy Di and Kibaek Kim

Weighting method for non-preemptive multi-objective mathematical programming pp. 353-371

Leonardo Ferro, Gianluca Filaci, Andrea Manzini and Antonio Ornatelli

Sample average approximation for portfolio optimization under CVaR constraint in a (re)insurance context pp. 373-399

Jérôme Lelong, Véronique Maume-Deschamps and William Thevenot

Discrete Fick’s law algorithm with new transfer function and aggregation optimization strategy for solving multiple knapsack problem pp. 401-438

Manman Meng, Yichao He, Wenbin Li, Guoxin Chen, Ju Chen and Zexian Gao