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 74, issue 3, 2019

Solution refinement at regular points of conic problems pp. 627-643

Enzo Busseti, Walaa M. Moursi and Stephen Boyd

Mesh adaptive direct search with simplicial Hessian update pp. 645-667

Árpád Bűrmen and Iztok Fajfar

Large-scale quasi-Newton trust-region methods with low-dimensional linear equality constraints pp. 669-701

Johannes J. Brust, Roummel F. Marcia and Cosmin G. Petra

Exact spectral-like gradient method for distributed optimization pp. 703-728

Dušan Jakovetić, Nataša Krejić and Nataša Krklec Jerinkić

A delayed weighted gradient method for strictly convex quadratic minimization pp. 729-746

Harry Fernando Oviedo Leon

Douglas–Rachford splitting and ADMM for pathological convex optimization pp. 747-778

Ernest K. Ryu, Yanli Liu and Wotao Yin

Optimal stochastic extragradient schemes for pseudomonotone stochastic variational inequality problems and their variants pp. 779-820

Aswin Kannan and Uday V. Shanbhag

Smoothing algorithms for computing the projection onto a Minkowski sum of convex sets pp. 821-850

Xiaolong Qin and Nguyen Thai An

An auction-based approach for the re-optimization shortest path tree problem pp. 851-893

P. Festa, F. Guerriero and A. Napoletano

Two new integer linear programming formulations for the vertex bisection problem pp. 895-918

Norberto Castillo-García and Paula Hernández Hernández

An efficient optimization approach for best subset selection in linear regression, with application to model selection and fitting in autoregressive time-series pp. 919-948

Leonardo Di Gangi, M. Lapucci, F. Schoen and A. Sortino

Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications pp. 949-949

Zhi Wang, K. Droegemeier and L. White

Volume 74, issue 2, 2019

On the conditions for the finite termination of ADMM and its applications to SOS polynomials feasibility problems pp. 317-344

Hikaru Komeiji, Sunyoung Kim and Makoto Yamashita

Additive and restricted additive Schwarz–Richardson methods for inequalities with nonlinear monotone operators pp. 345-385

Lori Badea

Computing the spark: mixed-integer programming for the (vector) matroid girth problem pp. 387-441

Andreas M. Tillmann

A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization pp. 443-480

Najmeh Hoseini Monjezi and S. Nobakhtian

A novel convex dual approach to three-dimensional assignment problem: theoretical analysis pp. 481-516

Jingqun Li, R. Tharmarasa, Daly Brown, Thia Kirubarajan and Krishna R. Pattipati

Minimizing the average searching time for an object within a graph pp. 517-545

Ron Teller, Moshe Zofi and Moshe Kaspi

Modified inexact Levenberg–Marquardt methods for solving nonlinear least squares problems pp. 547-582

Jifeng Bao, Carisa Kwok Wai Yu, Jinhua Wang, Yaohua Hu and Jen-Chih Yao

Interior point method on semi-definite linear complementarity problems using the Nesterov–Todd (NT) search direction: polynomial complexity and local convergence pp. 583-621

Chee-Khian Sim

Volume 74, issue 1, 2019

On level regularization with normal solutions in decomposition methods for multistage stochastic programming problems pp. 1-42

Wim Ackooij, Welington Oliveira and Yongjia Song

A family of spectral gradient methods for optimization pp. 43-65

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

Non-stationary Douglas–Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence pp. 67-92

Dirk A. Lorenz and Quoc Tran-Dinh

Quasi-Newton approaches to interior point methods for quadratic problems pp. 93-120

J. Gondzio and F. N. C. Sobral

A dense initialization for limited-memory quasi-Newton methods pp. 121-142

Johannes Brust, Oleg Burdakov, Jennifer B. Erway and Roummel F. Marcia

Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning pp. 143-176

Yiran Cui, Keiichi Morikuni, Takashi Tsuchiya and Ken Hayami

A subspace SQP method for equality constrained optimization pp. 177-194

Jae Hwa Lee, Yoon Mo Jung, Ya-xiang Yuan and Sangwoon Yun

A conjugate gradient-based algorithm for large-scale quadratic programming problem with one quadratic constraint pp. 195-223

A. Taati and M. Salahi

A difference-of-convex functions approach for sparse PDE optimal control problems with nonconvex costs pp. 225-258

Pedro Merino

Bounds for integration matrices that arise in Gauss and Radau collocation pp. 259-273

Wanchun Chen, Wenhao Du, William W. Hager and Liang Yang

Convergence rate for a Radau hp collocation method applied to constrained optimal control pp. 275-314

William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao and Xiang-Sheng Wang

Correction to: Convergence rate for a Radau hp collocation method applied to constrained optimal control pp. 315-316

William W. Hager, Hongyan Hou, Subhashree Mohapatra, Anil V. Rao and Xiang-Sheng Wang

Volume 73, issue 3, 2019

A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization pp. 707-753

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

Regularized Jacobi-type ADMM-methods for a class of separable convex optimization problems in Hilbert spaces pp. 755-790

Eike Börgens and Christian Kanzow

Robust optimal discrete arc sizing for tree-shaped potential networks pp. 791-819

Martin Robinius, Lars Schewe, Martin Schmidt, Detlef Stolten, Johannes Thürauf and Lara Welder

An algorithm for equilibrium selection in generalized Nash equilibrium problems pp. 821-837

Axel Dreves

A parameterized Douglas–Rachford algorithm pp. 839-869

Dongying Wang and Xianfu Wang

On relaxation of some customized proximal point algorithms for convex minimization: from variational inequality perspective pp. 871-901

Feng Ma

A simple convergence analysis of Bregman proximal gradient algorithm pp. 903-912

Yi Zhou, Yingbin Liang and Lixin Shen

Modified extragradient-like algorithms with new stepsizes for variational inequalities pp. 913-932

Dang Hieu, Pham Ky Anh and Le Dung Muu

The Uzawa-MBB type algorithm for nonsymmetric saddle point problems pp. 933-956

Zhitao Xu and Li Gao

Convergence of a stabilized SQP method for equality constrained optimization pp. 957-996

Songqiang Qiu

Maximum–norm a posteriori error estimates for an optimal control problem pp. 997-1017

Enrique Otárola, Richard Rankin and Abner J. Salgado

Correction to: The adjoint Newton algorithm for large-scale unconstrained optimization in meteorology applications pp. 1019-1019

Zhi Wang, K. Droegemeier and L. White

Volume 73, issue 2, 2019

Iteratively reweighted $$\ell _1$$ ℓ 1 algorithms with extrapolation pp. 353-386

Peiran Yu and Ting Kei Pong

Empirical risk minimization: probabilistic complexity and stepsize strategy pp. 387-410

Chin Pang Ho and Panos Parpas

An almost cyclic 2-coordinate descent method for singly linearly constrained problems pp. 411-452

Andrea Cristofari

A singular value p-shrinkage thresholding algorithm for low rank matrix recovery pp. 453-476

Yu-Fan Li, Kun Shang and Zheng-Hai Huang

A semismooth Newton method for support vector classification and regression pp. 477-508

Juan Yin and Qingna Li

A sub-additive DC approach to the complementarity problem pp. 509-534

L. Abdallah, M. Haddou and T. Migot

Optimized choice of parameters in interior-point methods for linear programming pp. 535-574

Luiz-Rafael Santos, Fernando Villas-Bôas, Aurelio R. L. Oliveira and Clovis Perin

Parallel PIPS-SBB: multi-level parallelism for stochastic mixed-integer programs pp. 575-601

Lluís-Miquel Munguía, Geoffrey Oxberry, Deepak Rajan and Yuji Shinano

Ordered p-median problems with neighbourhoods pp. 603-645

Víctor Blanco

Markov–Dubins interpolating curves pp. 647-677

C. Yalçın Kaya

Linearization of Euclidean norm dependent inequalities applied to multibeam satellites design pp. 679-705

Jean-Thomas Camino, Christian Artigues, Laurent Houssin and Stéphane Mourgues

Volume 73, issue 1, 2019

Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems pp. 1-35

Nicholas I. M. Gould, Tyrone Rees and Jennifer A. Scott

A new approximation hierarchy for polynomial conic optimization pp. 37-67

Peter J. C. Dickinson and Janez Povh

A refined convergence analysis of $$\hbox {pDCA}_{e}$$ pDCA e with applications to simultaneous sparse recovery and outlier detection pp. 69-100

Tianxiang Liu, Ting Kei Pong and Akiko Takeda

Graph-based algorithms for the efficient solution of optimization problems involving monotone functions pp. 101-128

Luca Consolini, Mattia Laurini and Marco Locatelli

General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems pp. 129-158

Zhongming Wu and Min Li

Fast bundle-level methods for unconstrained and ball-constrained convex optimization pp. 159-199

Yunmei Chen, Guanghui Lan, Yuyuan Ouyang and Wei Zhang

Inexact alternating direction methods of multipliers for separable convex optimization pp. 201-235

William W. Hager and Hongchao Zhang

Projective method of multipliers for linearly constrained convex minimization pp. 237-273

Majela Pentón Machado

A strong Lagrangian relaxation for general discrete-choice network revenue management pp. 275-310

Sumit Kunnumkal and Kalyan Talluri

PAL-Hom method for QP and an application to LP pp. 311-352

Guoqiang Wang and Bo Yu