Computational Optimization and Applications

2006 - 2023

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.
Track citations for all items by RSS feed
Is something missing from the series or not right? See the RePEc data check for the archive and series.

Volume 83, issue 3, 2022

COAP 2021 Best Paper Prize pp. 723-726

Christian Kanzow and Theresa Lechner

General-purpose preconditioning for regularized interior point methods pp. 727-757

Jacek Gondzio, Spyridon Pougkakiotis and John W. Pearson

Modeling design and control problems involving neural network surrogates pp. 759-800

Dominic Yang, Prasanna Balaprakash and Sven Leyffer

Solving constrained nonsmooth group sparse optimization via group Capped- $$\ell _1$$ ℓ 1 relaxation and group smoothing proximal gradient algorithm pp. 801-844

Xian Zhang and Dingtao Peng

“FISTA” in Banach spaces with adaptive discretisations pp. 845-892

Antonin Chambolle and Robert Tovey

New Bregman proximal type algorithms for solving DC optimization problems pp. 893-931

Shota Takahashi, Mituhiro Fukuda and Mirai Tanaka

Completely positive factorization by a Riemannian smoothing method pp. 933-966

Zhijian Lai and Akiko Yoshise

An extrapolated iteratively reweighted $$\ell _1$$ ℓ 1 method with complexity analysis pp. 967-997

Hao Wang, Hao Zeng and Jiashan Wang

Computable centering methods for spiraling algorithms and their duals, with motivations from the theory of Lyapunov functions pp. 999-1026

Scott B. Lindstrom

A stabilized sequential quadratic semidefinite programming method for degenerate nonlinear semidefinite programs pp. 1027-1064

Yuya Yamakawa and Takayuki Okuno

Volume 83, issue 2, 2022

Levenberg–Marquardt method based on probabilistic Jacobian models for nonlinear equations pp. 381-401

Ruixue Zhao and Jinyan Fan

Globally convergent Newton-type methods for multiobjective optimization pp. 403-434

M. L. N. Gonçalves, F. S. Lima and L. F. Prudente

Efficient scalarization in multiobjective optimal control of a nonsmooth PDE pp. 435-464

Marco Bernreuther, Georg Müller and Stefan Volkwein

Stochastic relaxed inertial forward-backward-forward splitting for monotone inclusions in Hilbert spaces pp. 465-524

Shisheng Cui, Uday Shanbhag, Mathias Staudigl and Phan Vuong

Minimum cost b-matching problems with neighborhoods pp. 525-553

I. Espejo, R. Páez, J. Puerto and A. M. Rodríguez-Chía

Shortest path with acceleration constraints: complexity and approximation algorithms pp. 555-592

S. Ardizzoni, L. Consolini, M. Laurini and M. Locatelli

A generalized shortest path tour problem with time windows pp. 593-614

L. Di Puglia Pugliese, D. Ferone, P. Festa and F. Guerriero

Generalized Nesterov’s accelerated proximal gradient algorithms with convergence rate of order o(1/k2) pp. 615-649

Huynh Ngai and Ta Anh Son

Some modified fast iterative shrinkage thresholding algorithms with a new adaptive non-monotone stepsize strategy for nonsmooth and convex minimization problems pp. 651-691

Hongwei Liu, Ting Wang and Zexian Liu

Minimization over the $$\ell _1$$ ℓ 1 -ball using an active-set non-monotone projected gradient pp. 693-721

Andrea Cristofari, Marianna Santis, Stefano Lucidi and Francesco Rinaldi

Volume 83, issue 1, 2022

Block coordinate descent for smooth nonconvex constrained minimization pp. 1-27

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

Quantifying uncertainty with ensembles of surrogates for blackbox optimization pp. 29-66

Charles Audet, Sébastien Le Digabel and Renaud Saltet

Polyhedral analysis and a new algorithm for the length constrained K–drones rural postman problem pp. 67-109

James Campbell, Ángel Corberán, Isaac Plana, José M. Sanchis and Paula Segura

Robust min-max regret covering problems pp. 111-141

Amadeu A. Coco, Andréa Cynthia Santos and Thiago F. Noronha

A stochastic primal-dual method for a class of nonconvex constrained optimization pp. 143-180

Lingzi Jin and Xiao Wang

Sub-linear convergence of a stochastic proximal iteration method in Hilbert space pp. 181-210

Monika Eisenmann, Tony Stillfjord and Måns Williamson

Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming pp. 211-246

Fabio Vitor and Todd Easton

Inertial alternating direction method of multipliers for non-convex non-smooth optimization pp. 247-285

Le Thi Khanh Hien, Duy Nhat Phan and Nicolas Gillis

Fast inertial dynamic algorithm with smoothing method for nonsmooth convex optimization pp. 287-317

Xin Qu and Wei Bian

A product space reformulation with reduced dimension for splitting algorithms pp. 319-348

Rubén Campoy

Abstract strongly convergent variants of the proximal point algorithm pp. 349-380

Andrei Sipoş

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