Economics at your fingertips  

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

Accelerated derivative-free nonlinear least-squares applied to the estimation of Manning coefficients pp. 689-715 Downloads
E. G. Birgin and J. M. Martínez
On the acceleration of the Barzilai–Borwein method pp. 717-740 Downloads
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 Downloads
Dominique Monnet, Warren Hare and Yves Lucet
Nonmonotone trust region algorithm for solving the unconstrained multiobjective optimization problems pp. 769-788 Downloads
V. A. Ramirez and G. N. Sottosanto
Clustering-based multipopulation approaches in MOEA/D for many-objective problems pp. 789-828 Downloads
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 Downloads
Donghui Li, Xiaozhou Wang and Jiajian Huang
Method for solving bang-bang and singular optimal control problems using adaptive Radau collocation pp. 857-887 Downloads
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 Downloads
Mengya Feng and Tongjun Sun
Finding the global optimum of a class of quartic minimization problem pp. 923-954 Downloads
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 Downloads
Liaoyuan Zeng and Ting Kei Pong
On a primal-dual Newton proximal method for convex quadratic programs pp. 369-395 Downloads
Alberto Marchi
Sequential optimality conditions for nonlinear optimization on Riemannian manifolds and a globally convergent augmented Lagrangian method pp. 397-421 Downloads
Yuya Yamakawa and Hiroyuki Sato
Linearization and parallelization schemes for convex mixed-integer nonlinear optimization pp. 423-478 Downloads
Meenarli Sharma, Prashant Palkar and Ashutosh Mahajan
An inexact accelerated stochastic ADMM for separable convex optimization pp. 479-518 Downloads
Jianchao Bai, William W. Hager and Hongchao Zhang
A smoothing proximal gradient algorithm for matrix rank minimization problem pp. 519-538 Downloads
Quan Yu and Xinzhen Zhang
A reduced proximal-point homotopy method for large-scale non-convex BQP pp. 539-567 Downloads
Xiubo Liang, Guoqiang Wang and Bo Yu
Iterative regularization for constrained minimization formulations of nonlinear inverse problems pp. 569-611 Downloads
Barbara Kaltenbacher and Kha Huynh
An alternate approach to solve two-level priority based assignment problem pp. 613-656 Downloads
Fanrong Xie, Anuj Sharma and Zuoan Li
A general variable neighborhood search for the cyclic antibandwidth problem pp. 657-687 Downloads
Sergio Cavero, Eduardo G. Pardo and Abraham Duarte

Volume 81, issue 1, 2022

On large-scale unconstrained optimization and arbitrary regularization pp. 1-30 Downloads
J. M. Martínez and L. T. Santos
A sublevel moment-SOS hierarchy for polynomial optimization pp. 31-66 Downloads
Tong Chen, Jean-Bernard Lasserre, Victor Magron and Edouard Pauwels
A Riemannian rank-adaptive method for low-rank matrix completion pp. 67-90 Downloads
Bin Gao and P.-A. Absil
On the inexact scaled gradient projection method pp. 91-125 Downloads
O. P. Ferreira, M. Lemes and L. F. Prudente
Bregman primal–dual first-order method and application to sparse semidefinite programming pp. 127-159 Downloads
Xin Jiang and Lieven Vandenberghe
On R-linear convergence analysis for a class of gradient methods pp. 161-177 Downloads
Na Huang
Expected complexity analysis of stochastic direct-search pp. 179-200 Downloads
Kwassi Joseph Dzahini
Adaptive partition-based SDDP algorithms for multistage stochastic linear programming with fixed recourse pp. 201-250 Downloads
Murwan Siddig and Yongjia Song
A piecewise conservative method for unconstrained convex optimization pp. 251-288 Downloads
A. Scagliotti and P. Colli Franzone
Finding best approximation pairs for two intersections of closed convex sets pp. 289-308 Downloads
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 Downloads
Michael Haythorpe and Walter Murray

Volume 80, issue 3, 2021

A data-driven approach for a class of stochastic dynamic optimization problems pp. 687-729 Downloads
Thuener Silva, Davi Valladão and Tito Homem- de-Mello
A zeroth order method for stochastic weakly convex optimization pp. 731-753 Downloads
V. Kungurtsev and F. Rinaldi
Two limited-memory optimization methods with minimum violation of the previous secant conditions pp. 755-780 Downloads
Jan Vlček and Ladislav Lukšan
A distributed algorithm for high-dimension convex quadratically constrained quadratic programs pp. 781-830 Downloads
Run Chen and Andrew L. Liu
A parallel splitting ALM-based algorithm for separable convex programming pp. 831-851 Downloads
Shengjie Xu and Bingsheng He
Optimal portfolio selections via $$\ell _{1, 2}$$ ℓ 1, 2 -norm regularization pp. 853-881 Downloads
Hongxin Zhao, Lingchen Kong and Hou-Duo Qi
T-product factorization method for internet traffic data completion with spatio-temporal regularization pp. 883-913 Downloads
Chen Ling, Gaohang Yu, Liqun Qi and Yanwei Xu
$${\text {B}}$$ B -subdifferentials of the projection onto the matrix simplex pp. 915-941 Downloads
Shenglong Hu and Guoyin Li
Accelerating convergence of a globalized sequential quadratic programming method to critical Lagrange multipliers pp. 943-978 Downloads
A. F. Izmailov
Nonsmooth exact penalization second-order methods for incompressible bi-viscous fluids pp. 979-1025 Downloads
Sergio González-Andrade, Sofía López-Ordóñez and Pedro Merino

Volume 80, issue 2, 2021

Forward-reflected-backward method with variance reduction pp. 321-346 Downloads
Ahmet Alacaoglu, Yura Malitsky and Volkan Cevher
MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM pp. 347-375 Downloads
Timotej Hrga and Janez Povh
Two new bidirectional search algorithms pp. 377-409 Downloads
John A. Pavlik, Edward C. Sewell and Sheldon H. Jacobson
An augmented subgradient method for minimizing nonsmooth DC functions pp. 411-438 Downloads
A. M. Bagirov, N. Hoseini Monjezi and S. Taheri
On solving a class of fractional semi-infinite polynomial programming problems pp. 439-481 Downloads
Feng Guo and Liguo Jiao
Exploiting term sparsity in noncommutative polynomial optimization pp. 483-521 Downloads
Jie Wang and Victor Magron
Two methods for the maximization of homogeneous polynomials over the simplex pp. 523-548 Downloads
Faizan Ahmed and Georg Still
Strengthened splitting methods for computing resolvents pp. 549-585 Downloads
Francisco J. Aragón Artacho, Rubén Campoy and Matthew K. Tam
Newton-type methods near critical solutions of piecewise smooth nonlinear equations pp. 587-615 Downloads
A. Fischer, A. F. Izmailov and M. Jelitte
The selection of the optimal parameter in the modulus-based matrix splitting algorithm for linear complementarity problems pp. 617-638 Downloads
Zhizhi Li, Huai Zhang and Le Ou-Yang
A proximal gradient method for control problems with non-smooth and non-convex control cost pp. 639-677 Downloads
Carolin Natemeyer and Daniel Wachsmuth
Correction to: Globalized inexact proximal Newton-type methods for nonconvex composite functions pp. 679-680 Downloads
Christian Kanzow and Theresa Lechner

Volume 80, issue 1, 2021

An effective procedure for feature subset selection in logistic regression based on information criteria pp. 1-32 Downloads
Enrico Civitelli, Matteo Lapucci, Fabio Schoen and Alessio Sortino
A parameter-free unconstrained reformulation for nonsmooth problems with convex constraints pp. 33-53 Downloads
Giulio Galvan, Marco Sciandrone and Stefano Lucidi
Compact representations of structured BFGS matrices pp. 55-88 Downloads
Johannes J. Brust, Zichao (Wendy) Di, Sven Leyffer and Cosmin G. Petra
An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation pp. 89-120 Downloads
Xiaodong Ding, Hezhi Luo, Huixian Wu and Jianzhen Liu
Minibatch stochastic subgradient-based projection algorithms for feasibility problems with convex inequalities pp. 121-152 Downloads
Ion Necoara and Angelia Nedić
Stochastic mathematical programs with probabilistic complementarity constraints: SAA and distributionally robust approaches pp. 153-184 Downloads
Shen Peng and Jie Jiang
Sequential optimality conditions for cardinality-constrained optimization problems with applications pp. 185-211 Downloads
Christian Kanzow, Andreas B. Raharja and Alexandra Schwartz
Quadratic convergence analysis of a nonmonotone Levenberg–Marquardt type method for the weighted nonlinear complementarity problem pp. 213-244 Downloads
Jingyong Tang and Jinchuan Zhou
Alternating conditional gradient method for convex feasibility problems pp. 245-269 Downloads
R. Díaz Millán, O. P. Ferreira and L. F. Prudente
Sparse Dirichlet optimal control problems pp. 271-300 Downloads
Mariano Mateos
A third-order weighted essentially non-oscillatory scheme in optimal control problems governed by nonlinear hyperbolic conservation laws pp. 301-320 Downloads
David Frenzel and Jens Lang
Page updated 2023-06-03