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 86, issue 3, 2023

Preface to Asen L. Dontchev Memorial Special Issue pp. 795-800

William W. Hager, R. Tyrrell Rockafellar and Vladimir M. Veliov

First order inertial optimization algorithms with threshold effects associated with dry friction pp. 801-843

Samir Adly, Hedy Attouch and Manh Hung Le

Distributed forward-backward methods for ring networks pp. 845-870

Francisco J. Aragón-Artacho, Yura Malitsky, Matthew K. Tam and David Torregrosa-Belén

Linear singularly perturbed systems without slow-fast split pp. 871-884

Zvi Artstein

A Filippov approximation theorem for strengthened one-sided Lipschitz differential inclusions pp. 885-923

Robert Baier and Elza Farkhi

An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function pp. 925-966

Radu Ioan Boţ, Ernö Robert Csetnek and Michael Sedlmayer

Robust and continuous metric subregularity for linear inequality systems pp. 967-988

J. Camacho, M. J. Cánovas, M. A. López and J. Parra

A study of progressive hedging for stochastic integer programming pp. 989-1034

Jeffrey Christiansen, Brian Dandurand, Andrew Eberhard and Fabricio Oliveira

On the solution stability of parabolic optimal control problems pp. 1035-1079

Alberto Domínguez Corella, Nicolai Jork and Vladimir M. Veliov

Relaxed dissipativity assumptions and a simplified algorithm for multiobjective MPC pp. 1081-1116

Gabriele Eichfelder, Lars Grüne, Lisa Krügel and Jonas Schießl

Radius theorems for subregularity in infinite dimensions pp. 1117-1158

Helmut Gfrerer and Alexander Y. Kruger

On the SCD semismooth* Newton method for generalized equations with application to a class of static contact problems with Coulomb friction pp. 1159-1191

Helmut Gfrerer, Michael Mandlmayr, Jiří V. Outrata and Jan Valdman

Perturbation analysis of the euclidean distance matrix optimization problem and its numerical implications pp. 1193-1227

Shaoyan Guo, Hou-Duo Qi and Liwei Zhang

Extension of switch point algorithm to boundary-value problems pp. 1229-1246

William W. Hager

Optimization over the Pareto front of nonconvex multi-objective optimal control problems pp. 1247-1274

C. Yalçın Kaya and Helmut Maurer

Optimality conditions for Tucker low-rank tensor optimization pp. 1275-1298

Ziyan Luo and Liqun Qi

Error estimates for Runge–Kutta schemes of optimal control problems with index 1 DAEs pp. 1299-1325

Björn Martens

Generic linear convergence through metric subregularity in a variable-metric extension of the proximal point algorithm pp. 1327-1346

R. Tyrrell Rockafellar

The deepest event cuts in risk-averse optimization with application to radiation therapy design pp. 1347-1372

Constantine A. Vitt, Darinka Dentcheva, Andrzej Ruszczyński and Nolan Sandberg

Volume 86, issue 2, 2023

An accelerated proximal gradient method for multiobjective optimization pp. 421-455

Hiroki Tanabe, Ellen H. Fukuda and Nobuo Yamashita

Spectral conjugate gradient methods for vector optimization problems pp. 457-489

Qing-Rui He, Chun-Rong Chen and Sheng-Jie Li

A branch-and-prune algorithm for discrete Nash equilibrium problems pp. 491-519

Stefan Schwarze and Oliver Stein

Doubly majorized algorithm for sparsity-inducing optimization problems with regularizer-compatible constraints pp. 521-553

Tianxiang Liu, Ting Kei Pong and Akiko Takeda

Complexity analysis of interior-point methods for second-order stationary points of nonlinear semidefinite optimization problems pp. 555-598

Shun Arahata, Takayuki Okuno and Akiko Takeda

SCORE: approximating curvature information under self-concordant regularization pp. 599-626

Adeyemi D. Adeoye and Alberto Bemporad

Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound pp. 627-667

Dongdong Zhang, Shaohua Pan, Shujun Bi and Defeng Sun

A dual-based stochastic inexact algorithm for a class of stochastic nonsmooth convex composite problems pp. 669-710

Gui-Hua Lin, Zhen-Ping Yang, Hai-An Yin and Jin Zhang

A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity pp. 711-743

Letícia Becher, Damián Fernández and Alberto Ramos

Sparse optimization via vector k-norm and DC programming with an application to feature selection for support vector machines pp. 745-766

Manlio Gaudioso, Giovanni Giallombardo and Giovanna Miglionico

A space–time variational method for optimal control problems: well-posedness, stability and numerical solution pp. 767-794

Nina Beranek, Martin Alexander Reinhold and Karsten Urban

Volume 86, issue 1, 2023

A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming pp. 1-48

David Ek and Anders Forsgren

Recycling basic columns of the splitting preconditioner in interior point methods pp. 49-78

Cecilia Orellana Castro, Manolo Rodriguez Heredia and Aurelio R. L. Oliveira

Accelerating stochastic sequential quadratic programming for equality constrained optimization using predictive variance reduction pp. 79-116

Albert S. Berahas, Jiahao Shi, Zihong Yi and Baoyu Zhou

On proximal augmented Lagrangian based decomposition methods for dual block-angular convex composite programming problems pp. 117-161

Kuang-Yu Ding, Xin-Yee Lam and Kim-Chuan Toh

On solving difference of convex functions programs with linear complementarity constraints pp. 163-197

Hoai An Thi, Thi Minh Tam Nguyen and Tao Pham Dinh

Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints pp. 199-240

Hezhi Luo, Xianye Zhang, Huixian Wu and Weiqiang Xu

An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints pp. 241-273

Shaoze Li, Zhibin Deng, Cheng Lu, Junhao Wu, Jinyu Dai and Qiao Wang

Average curvature FISTA for nonconvex smooth composite optimization problems pp. 275-302

Jiaming Liang and Renato D. C. Monteiro

Convergence of an asynchronous block-coordinate forward-backward algorithm for convex composite optimization pp. 303-344

Cheik Traoré, Saverio Salzo and Silvia Villa

A smoothing Newton method based on the modulus equation for a class of weakly nonlinear complementarity problems pp. 345-381

Baohua Huang and Wen Li

GLISp-r: a preference-based optimization algorithm with convergence guarantees pp. 383-420

Davide Previtali, Mirko Mazzoleni, Antonio Ferramosca and Fabio Previdi

Volume 85, issue 3, 2023

Preface to the 5th Brazil–China Symposium on Applied and Computational Mathematics pp. 681-682

Jinyun Yuan

Quadratic regularization methods with finite-difference gradient approximations pp. 683-703

Geovani Nunes Grapiglia

Distributionally robust Weber problem with uncertain demand pp. 705-752

Yan Gu, Jianlin Jiang and Shun Zhang

Greedy PSB methods with explicit superlinear convergence pp. 753-786

Zhen-Yuan Ji and Yu-Hong Dai

Increasing reliability of price signals in long term energy management problems pp. 787-820

Guillaume Erbs, Clara Lage, Claudia Sagastizábal and Mikhail Solodov

Convergence of derivative-free nonmonotone Direct Search Methods for unconstrained and box-constrained mixed-integer optimization pp. 821-856

Ubaldo M. García Palomares

Conditional gradient method for vector optimization pp. 857-896

Wang Chen, Xinmin Yang and Yong Zhao

Riemannian optimization on unit sphere with p-norm and its applications pp. 897-935

Hiroyuki Sato

Inexact penalty decomposition methods for optimization problems with geometric constraints pp. 937-971

Christian Kanzow and Matteo Lapucci

Convergence rate estimates for penalty methods revisited pp. 973-992

A. F. Izmailov and M. V. Solodov

DC semidefinite programming and cone constrained DC optimization II: local search methods pp. 993-1031

M. V. Dolgopolik

A communication-efficient and privacy-aware distributed algorithm for sparse PCA pp. 1033-1072

Lei Wang, Xin Liu and Yin Zhang

Volume 85, issue 2, 2023

Branch-and-Model: a derivative-free global optimization algorithm pp. 337-367

Kaiwen Ma, Luis Miguel Rios, Atharv Bhosekar, Nikolaos V. Sahinidis and Sreekanth Rajagopalan

Results for the close-enough traveling salesman problem with a branch-and-bound algorithm pp. 369-407

Wenda Zhang, Jason J. Sauppe and Sheldon H. Jacobson

Globally optimal univariate spline approximations pp. 409-439

Robert Mohr, Maximilian Coblenz and Peter Kirst

A relaxation-based probabilistic approach for PDE-constrained optimization under uncertainty with pointwise state constraints pp. 441-478

Drew P. Kouri, Mathias Staudigl and Thomas M. Surowiec

Optimal control of the stationary Kirchhoff equation pp. 479-508

Masoumeh Hashemi, Roland Herzog and Thomas M. Surowiec

An accelerated inexact dampened augmented Lagrangian method for linearly-constrained nonconvex composite optimization problems pp. 509-545

Weiwei Kong and Renato D. C. Monteiro

A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem pp. 547-582

Yong-Jin Liu and Jing Yu

Doubly iteratively reweighted algorithm for constrained compressed sensing models pp. 583-619

Shuqin Sun and Ting Kei Pong

Partially symmetric tensor structure preserving rank-R approximation via BFGS algorithm pp. 621-652

Ciwen Chen, Guyan Ni and Bo Yang

A stochastic variance-reduced accelerated primal-dual method for finite-sum saddle-point problems pp. 653-679

Erfan Yazdandoost Hamedani and Afrooz Jalilzadeh

Volume 85, issue 1, 2023

An inexact Riemannian proximal gradient method pp. 1-32

Wen Huang and Ke Wei

A limited memory Quasi-Newton approach for multi-objective optimization pp. 33-73

Matteo Lapucci and Pierluigi Mansueto

A harmonic framework for stepsize selection in gradient methods pp. 75-106

Giulia Ferrandi, Michiel E. Hochstenbach and Nataša Krejić

An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems pp. 107-146

Hong T. M. Chu, Ling Liang, Kim-Chuan Toh and Lei Yang

A split Levenberg-Marquardt method for large-scale sparse problems pp. 147-179

Nataša Krejić, Greta Malaspina and Lense Swaenen

Integer set reduction for stochastic mixed-integer programming pp. 181-211

Saravanan Venkatachalam and Lewis Ntaimo

Simple approximative algorithms for free-support Wasserstein barycenters pp. 213-246

Johannes von Lindheim

A simultaneous diagonalization based SOCP relaxation for portfolio optimization with an orthogonality constraint pp. 247-261

Zhijun Xu and Jing Zhou

An alternative extrapolation scheme of PDHGM for saddle point problem with nonlinear function pp. 263-291

Ying Gao and Wenxing Zhang

A two-time-level model for mission and flight planning of an inhomogeneous fleet of unmanned aerial vehicles pp. 293-335

Johannes Schmidt and Armin Fügenschuh