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 82, issue 3, 2022

Finite-sum smooth optimization with SARAH pp. 561-593

Lam M. Nguyen, Marten Dijk, Dzung T. Phan, Phuong Ha Nguyen, Tsui-Wei Weng and Jayant R. Kalagnanam

Randomized Kaczmarz methods for tensor complementarity problems pp. 595-615

Xuezhong Wang, Maolin Che and Yimin Wei

Cut-sharing across trees and efficient sequential sampling for SDDP with uncertainty in the RHS pp. 617-647

Pedro Borges

DC Semidefinite programming and cone constrained DC optimization I: theory pp. 649-671

M. V. Dolgopolik

Accelerated inexact composite gradient methods for nonconvex spectral optimization problems pp. 673-715

Weiwei Kong and Renato D. C. Monteiro

Design of a heuristic algorithm for the generalized multi-objective set covering problem pp. 717-751

Lakmali Weerasena, Aniekan Ebiefung and Anthony Skjellum

A path-following inexact Newton method for PDE-constrained optimal control in BV pp. 753-794

D. Hafemeyer and F. Mannel

Volume 82, issue 2, 2022

Derivative-free methods for mixed-integer nonsmooth constrained optimization pp. 293-327

Tommaso Giovannelli, Giampaolo Liuzzi, Stefano Lucidi and Francesco Rinaldi

On initial point selection of the steepest descent algorithm for general quadratic functions pp. 329-360

Masoud Fatemi

Accelerated gradient sliding for structured convex optimization pp. 361-394

Guanghui Lan and Yuyuan Ouyang

Douglas–Rachford splitting and ADMM for nonconvex optimization: accelerated and Newton-type linesearch algorithms pp. 395-440

Andreas Themelis, Lorenzo Stella and Panagiotis Patrinos

Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems pp. 441-463

Xianfu Wang and Ziyuan Wang

Second order semi-smooth Proximal Newton methods in Hilbert spaces pp. 465-498

Bastian Pötzl, Anton Schiela and Patrick Jaap

A level set method for Laplacian eigenvalue optimization subject to geometric constraints pp. 499-524

Meizhi Qian and Shengfeng Zhu

QUAntum Particle Swarm Optimization: an auto-adaptive PSO for local and global optimization pp. 525-559

Arnaud Flori, Hamouche Oulhadj and Patrick Siarry

Volume 82, issue 1, 2022

Leveraging special-purpose hardware for local search heuristics pp. 1-29

Xiaoyuan Liu, Hayato Ushijima-Mwesigwa, Avradip Mandal, Sarvagya Upadhyay, Ilya Safro and Arnab Roy

An adaptive trust-region method without function evaluations pp. 31-60

Geovani N. Grapiglia and Gabriel F. D. Stella

A regularized limited memory BFGS method for large-scale unconstrained optimization and its efficient implementations pp. 61-88

Hardik Tankaria, Shinji Sugimoto and Nobuo Yamashita

Local saddle points for unconstrained polynomial optimization pp. 89-106

Wenjie Zhao and Guangming Zhou

Parametric shape optimization using the support function pp. 107-138

Pedro R. S. Antunes and Beniamin Bogosel

Correction to: Parametric shape optimization using the support function pp. 139-139

Pedro R. S. Antunes and Beniamin Bogosel

An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems pp. 141-173

Tianxiang Liu and Akiko Takeda

Complexity of an inexact proximal-point penalty method for constrained smooth non-convex optimization pp. 175-224

Qihang Lin, Runchao Ma and Yangyang Xu

Robust output-feedback stabilization for incompressible flows using low-dimensional $$\mathcal {H}_{\infty }$$ H ∞ -controllers pp. 225-249

Peter Benner, Jan Heiland and Steffen W. R. Werner

SDP-based bounds for graph partition via extended ADMM pp. 251-291

Angelika Wiegele and Shudian Zhao

Volume 81, issue 3, 2022

Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients pp. 689-715

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

On the acceleration of the Barzilai–Borwein method pp. 717-740

Yakui Huang, Yu-Hong Dai, Xin-Wei Liu and Hongchao Zhang

A successive relaxation algorithm to solve a MILP involving piecewise linear functions with application to road design pp. 741-767

Dominique Monnet, Warren Hare and Yves Lucet

Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems pp. 769-788

V. A. Ramirez and G. N. Sottosanto

Clustering-based multipopulation approaches in MOEA/D for many-objective problems pp. 789-828

Christian Lücken, Carlos A. Brizuela and Benjamín Barán

Diagonal BFGS updates and applications to the limited memory BFGS method pp. 829-856

Donghui Li, Xiaozhou Wang and Jiajian Huang

Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation pp. 857-887

Elisha R. Pager and Anil V. Rao

A priori error estimate of perturbation method for optimal control problem governed by elliptic PDEs with small uncertainties pp. 889-921

Mengya Feng and Tongjun Sun

Finding the global optimum of a class of quartic minimization problem pp. 923-954

Pengfei Huang, Qingzhi Yang and Yuning Yang

Volume 81, issue 2, 2022

$$\rho$$ ρ -regularization subproblems: strong duality and an eigensolver-based algorithm pp. 337-368

Liaoyuan Zeng and Ting Kei Pong

On a primal-dual Newton proximal method for convex quadratic programs pp. 369-395

Alberto Marchi

Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method pp. 397-421

Yuya Yamakawa and Hiroyuki Sato

Linearization and parallelization schemes for convex mixed-integer nonlinear optimization pp. 423-478

Meenarli Sharma, Prashant Palkar and Ashutosh Mahajan

An inexact accelerated stochastic ADMM for separable convex optimization pp. 479-518

Jianchao Bai, William W. Hager and Hongchao Zhang

A smoothing proximal gradient algorithm for matrix rank minimization problem pp. 519-538

Quan Yu and Xinzhen Zhang

A reduced proximal-point homotopy method for large-scale non-convex BQP pp. 539-567

Xiubo Liang, Guoqiang Wang and Bo Yu

Iterative regularization for constrained minimization formulations of nonlinear inverse problems pp. 569-611

Barbara Kaltenbacher and Kha Huynh

An alternate approach to solve two-level priority based assignment problem pp. 613-656

Fanrong Xie, Anuj Sharma and Zuoan Li

A general variable neighborhood search for the cyclic antibandwidth problem pp. 657-687

Sergio Cavero, Eduardo G. Pardo and Abraham Duarte

Volume 81, issue 1, 2022

On large-scale unconstrained optimization and arbitrary regularization pp. 1-30

J. M. Martínez and L. T. Santos

A sublevel moment-SOS hierarchy for polynomial optimization pp. 31-66

Tong Chen, Jean-Bernard Lasserre, Victor Magron and Edouard Pauwels

A Riemannian rank-adaptive method for low-rank matrix completion pp. 67-90

Bin Gao and P.-A. Absil

On the inexact scaled gradient projection method pp. 91-125

O. P. Ferreira, M. Lemes and L. F. Prudente

Bregman primal–dual first-order method and application to sparse semidefinite programming pp. 127-159

Xin Jiang and Lieven Vandenberghe

On R-linear convergence analysis for a class of gradient methods pp. 161-177

Na Huang

Expected complexity analysis of stochastic direct-search pp. 179-200

Kwassi Joseph Dzahini

Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse pp. 201-250

Murwan Siddig and Yongjia Song

A piecewise conservative method for unconstrained convex optimization pp. 251-288

A. Scagliotti and P. Colli Franzone

Finding best approximation pairs for two intersections of closed convex sets pp. 289-308

Heinz H. Bauschke, Shambhavi Singh and Xianfu Wang

Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem pp. 309-336

Michael Haythorpe and Walter Murray