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 87, issue 3, 2024

Preface to special issue on “optimal control of nonlinear differential equations” pp. 707-710

Christian Clason

Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier-Stokes equations with surface tension pp. 711-751

Elisabeth Diehl, Johannes Haubner, Michael Ulbrich and Stefan Ulbrich

Correction to: Differentiability results and sensitivity calculation for optimal control of incompressible two-phase Navier–Stokes equations with surface tension pp. 753-754

Elisabeth Diehl, Johannes Haubner, Michael Ulbrich and Stefan Ulbrich

A-posteriori reduced basis error-estimates for a semi-discrete in space quasilinear parabolic PDE pp. 755-784

Fabian Hoppe and Ira Neitzel

Policy iteration for Hamilton–Jacobi–Bellman equations with control constraints pp. 785-809

Sudeep Kundu and Karl Kunisch

Optimal control problems with $$L^0(\Omega )$$ L 0 ( Ω ) constraints: maximum principle and proximal gradient method pp. 811-833

Daniel Wachsmuth

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: Part I pp. 835-891

Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager and Robert Hildebrand

Enhancements of discretization approaches for non-convex mixed-integer quadratically constrained quadratic programming: part II pp. 893-934

Benjamin Beach, Robert Burlacu, Andreas Bärmann, Lukas Hager and Robert Hildebrand

The continuous stochastic gradient method: part I–convergence theory pp. 935-976

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

The continuous stochastic gradient method: part II–application and numerics pp. 977-1008

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

Correction to: The continuous stochastic gradient method: part II–application and numerics pp. 1009-1010

Max Grieshammer, Lukas Pflug, Michael Stingl and Andrian Uihlein

A family of Barzilai-Borwein steplengths from the viewpoint of scaled total least squares pp. 1011-1031

Shiru Li, Tao Zhang and Yong Xia

Internet traffic tensor completion with tensor nuclear norm pp. 1033-1057

Can Li, Yannan Chen and Dong-Hui Li

A Bregman–Kaczmarz method for nonlinear systems of equations pp. 1059-1098

Robert Gower, Dirk A. Lorenz and Maximilian Winkler

Volume 87, issue 2, 2024

Multiobjective BFGS method for optimization on Riemannian manifolds pp. 337-354

Shahabeddin Najafi and Masoud Hajarian

Distribution-free algorithms for predictive stochastic programming in the presence of streaming data pp. 355-395

Shuotao Diao and Suvrajeet Sen

Stochastic projective splitting pp. 397-437

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn and Shinjae Yoo

Correction to: Stochastic projective splitting pp. 439-439

Patrick R. Johnstone, Jonathan Eckstein, Thomas Flynn and Shinjae Yoo

Efficiency of higher-order algorithms for minimizing composite functions pp. 441-473

Yassine Nabou and Ion Necoara

A new technique to derive tight convex underestimators (sometimes envelopes) pp. 475-499

M. Locatelli

A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems pp. 501-530

Felipe Fidalgo, Emerson Castelani and Guilherme Philippi

A fast continuous time approach for non-smooth convex optimization using Tikhonov regularization technique pp. 531-569

Mikhail A. Karapetyants

Linearly convergent bilevel optimization with single-step inner methods pp. 571-610

Ensio Suonperä and Tuomo Valkonen

Inexact proximal DC Newton-type method for nonconvex composite functions pp. 611-640

Shummin Nakayama, Yasushi Narushima and Hiroshi Yabe

Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming pp. 641-676

Stuart Harwood, Francisco Trespalacios, Dimitri Papageorgiou and Kevin Furman

A nested genetic algorithm strategy for an optimal seismic design of frames pp. 677-704

A. Greco, F. Cannizzaro, R. Bruno and A. Pluchino

Correction: On the asymptotic rate of convergence of Stochastic Newton algorithms and their Weighted Averaged versions pp. 705-706

Claire Boyer and Antoine Godichon‑Baggioni

Volume 87, issue 1, 2024

Inexact proximal Newton methods in Hilbert spaces pp. 1-37

Bastian Pötzl, Anton Schiela and Patrick Jaap

Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming pp. 39-81

Shiwei Wang and Chao Ding

A successive centralized circumcentered-reflection method for the convex feasibility problem pp. 83-116

Roger Behling, Yunier Bello-Cruz, Alfredo Iusem, Di Liu and Luiz-Rafael Santos

Stochastic inexact augmented Lagrangian method for nonconvex expectation constrained optimization pp. 117-147

Zichong Li, Pin-Yu Chen, Sijia Liu, Songtao Lu and Yangyang Xu

A trust-region approach for computing Pareto fronts in multiobjective optimization pp. 149-179

A. Mohammadi and A. L. Custódio

From Halpern’s fixed-point iterations to Nesterov’s accelerated interpretations for root-finding problems pp. 181-218

Quoc Tran-Dinh

Generalizations of the proximal method of multipliers in convex optimization pp. 219-247

R. Tyrrell Rockafellar

Distributed stochastic compositional optimization problems over directed networks pp. 249-288

Shengchao Zhao and Yongchao Liu

A modified inexact Levenberg–Marquardt method with the descent property for solving nonlinear equations pp. 289-322

Jianghua Yin, Jinbao Jian and Guodong Ma

An easily computable upper bound on the Hoffman constant for homogeneous inequality systems pp. 323-335

Javier F. Peña

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