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 67, issue 3, 2017

Forward–backward quasi-Newton methods for nonsmooth optimization problems pp. 443-487 Downloads
Lorenzo Stella, Andreas Themelis and Panagiotis Patrinos
Further properties of the forward–backward envelope with applications to difference-of-convex programming pp. 489-520 Downloads
Tianxiang Liu and Ting Kei Pong
Total variation image deblurring with space-varying kernel pp. 521-541 Downloads
Daniel O’Connor and Lieven Vandenberghe
$$S_{1/2}$$ S 1 / 2 regularization methods and fixed point algorithms for affine rank minimization problems pp. 543-569 Downloads
Dingtao Peng, Naihua Xiu and Jian Yu
New subgradient extragradient methods for common solutions to equilibrium problems pp. 571-594 Downloads
Dang Hieu
Generalized Krasnoselskii–Mann-type iterations for nonexpansive mappings in Hilbert spaces pp. 595-620 Downloads
Christian Kanzow and Yekini Shehu

Volume 67, issue 2, 2017

Second-order orthant-based methods with enriched Hessian information for sparse $$\ell _1$$ ℓ 1 -optimization pp. 225-258 Downloads
J. C. De Los Reyes, E. Loayza and P. Merino
Local and global convergence of a general inertial proximal splitting scheme for minimizing composite functions pp. 259-292 Downloads
Patrick R. Johnstone and Pierre Moulin
Branch-and-price for p-cluster editing pp. 293-316 Downloads
Teobaldo Bulhões, Anand Subramanian, Gilberto F. Sousa Filho and Lucídio dos Anjos F. Cabral
Solving nearly-separable quadratic optimization problems as nonsmooth equations pp. 317-360 Downloads
Frank E. Curtis and Arvind U. Raghunathan
An SQP method for mathematical programs with vanishing constraints with strong convergence properties pp. 361-399 Downloads
Matúš Benko and Helmut Gfrerer
$$L^1$$ L 1 penalization of volumetric dose objectives in optimal control of PDEs pp. 401-419 Downloads
Richard C. Barnard and Christian Clason
Visualization of the $$\varepsilon $$ ε -subdifferential of piecewise linear–quadratic functions pp. 421-442 Downloads
Anuj Bajaj, Warren Hare and Yves Lucet

Volume 67, issue 1, 2017

A dual gradient-projection method for large-scale strictly convex quadratic problems pp. 1-38 Downloads
Nicholas I. M. Gould and Daniel P. Robinson
Error estimates for integral constraint regularization of state-constrained elliptic control problems pp. 39-71 Downloads
B. Jadamba, A. Khan and M. Sama
A Riemannian conjugate gradient method for optimization on the Stiefel manifold pp. 73-110 Downloads
Xiaojing Zhu
A new approach for finding a basis for the splitting preconditioner for linear systems from interior point methods pp. 111-127 Downloads
Porfirio Suñagua and Aurelio R. L. Oliveira
Subspace-stabilized sequential quadratic programming pp. 129-154 Downloads
A. F. Izmailov and E. I. Uskov
On merit functions for p-order cone complementarity problem pp. 155-173 Downloads
Xin-He Miao, Yu-Lin Chang and Jein-Shan Chen
Analysis on Newton projection method for the split feasibility problem pp. 175-199 Downloads
Biao Qu, Changyu Wang and Naihua Xiu
Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks pp. 201-223 Downloads
Filippo Pecci, Edo Abraham and Ivan Stoianov

Volume 66, issue 3, 2017

Structured regularization for barrier NLP solvers pp. 401-424 Downloads
Wei Wan and Lorenz T. Biegler
Adaptive smoothing algorithms for nonsmooth composite convex minimization pp. 425-451 Downloads
Quoc Tran-Dinh
A robust Lagrangian-DNN method for a class of quadratic optimization problems pp. 453-479 Downloads
Naohiko Arima, Sunyoung Kim, Masakazu Kojima and Kim-Chuan Toh
Partitioned quasi-Newton methods for sparse nonlinear equations pp. 481-505 Downloads
Hui-Ping Cao and Dong-Hui Li
A nonmonotone Jacobian smoothing inexact Newton method for NCP pp. 507-532 Downloads
Sanja Rapajić and Zoltan Papp
Quasi-Newton smoothed functional algorithms for unconstrained and constrained simulation optimization pp. 533-556 Downloads
K. Lakshmanan and Shalabh Bhatnagar
Formulating an n-person noncooperative game as a tensor complementarity problem pp. 557-576 Downloads
Zheng-Hai Huang and Liqun Qi
A polynomial primal-dual affine scaling algorithm for symmetric conic optimization pp. 577-600 Downloads
Ali Mohammad-Nezhad and Tamás Terlaky

Volume 66, issue 2, 2017

Local nonglobal minima for solving large-scale extended trust-region subproblems pp. 223-244 Downloads
Maziar Salahi, Akram Taati and Henry Wolkowicz
On solving L-SR1 trust-region subproblems pp. 245-266 Downloads
Johannes Brust, Jennifer B. Erway and Roummel F. Marcia
A semidefinite algorithm for completely positive tensor decomposition pp. 267-283 Downloads
Jinyan Fan and Anwa Zhou
Computing the generalized eigenvalues of weakly symmetric tensors pp. 285-307 Downloads
Na Zhao, Qingzhi Yang and Yajun Liu
Fast algorithm for singly linearly constrained quadratic programs with box-like constraints pp. 309-326 Downloads
Meijiao Liu and Yong-Jin Liu
A note on the convergence of ADMM for linearly constrained convex optimization problems pp. 327-343 Downloads
Liang Chen, Defeng Sun and Kim-Chuan Toh
Decomposable norm minimization with proximal-gradient homotopy algorithm pp. 345-381 Downloads
Reza Eghbali and Maryam Fazel
Modeling max–min fair bandwidth allocation in BitTorrent communities pp. 383-400 Downloads
Elvira Antal and Tamás Vinkó

Volume 66, issue 1, 2017

On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study pp. 1-37 Downloads
Ricardo M. Lima and Ignacio E. Grossmann
On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function pp. 39-73 Downloads
Xingju Cai, Deren Han and Xiaoming Yuan
Modified hybrid projection methods for finding common solutions to variational inequality problems pp. 75-96 Downloads
Dang Hieu, Pham Ky Anh and Le Dung Muu
Conic approximation to quadratic optimization with linear complementarity constraints pp. 97-122 Downloads
Jing Zhou, Shu-Cherng Fang and Wenxun Xing
A preconditioned descent algorithm for variational inequalities of the second kind involving the p-Laplacian operator pp. 123-162 Downloads
Sergio González-Andrade
Simple decentralized graph coloring pp. 163-185 Downloads
Severino F. Galán
Convex Euclidean distance embedding for collaborative position localization with NLOS mitigation pp. 187-218 Downloads
Chao Ding and Hou-Duo Qi
Erratum to: A regularized Newton method without line search for unconstrained optimization pp. 219-222 Downloads
Kenji Ueda and Nobuo Yamashita

Volume 65, issue 3, 2016

On handling indicator constraints in mixed integer programming pp. 545-566 Downloads
Pietro Belotti, Pierre Bonami, Matteo Fischetti, Andrea Lodi, Michele Monaci, Amaya Nogales-Gómez and Domenico Salvagnin
Are Quasi-Monte Carlo algorithms efficient for two-stage stochastic programs? pp. 567-603 Downloads
H. Heitsch, H. Leövey and W. Römisch
Performance of first- and second-order methods for $$\ell _1$$ ℓ 1 -regularized least squares problems pp. 605-635 Downloads
Kimon Fountoulakis and Jacek Gondzio
Inexact stabilized Benders’ decomposition approaches with application to chance-constrained problems with finite support pp. 637-669 Downloads
W. Ackooij, A. Frangioni and W. Oliveira
Smoothing projected Barzilai–Borwein method for constrained non-Lipschitz optimization pp. 671-698 Downloads
Yakui Huang and Hongwei Liu
Sequential equality-constrained optimization for nonlinear programming pp. 699-721 Downloads
E. G. Birgin, L. F. Bueno and J. M. Martínez
Algebraic rules for computing the regularization parameter of the Levenberg–Marquardt method pp. 723-751 Downloads
Elizabeth W. Karas, Sandra A. Santos and Benar F. Svaiter
A modified Levenberg–Marquardt method with line search for nonlinear equations pp. 753-779 Downloads
Liang Chen
An adaptive gradient method for computing generalized tensor eigenpairs pp. 781-797 Downloads
Gaohang Yu, Zefeng Yu, Yi Xu, Yisheng Song and Yi Zhou
Spherical optimization with complex variablesfor computing US-eigenpairs pp. 799-820 Downloads
Guyan Ni and Minru Bai
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices pp. 821-844 Downloads
Rafael A. Melo, Phillippe Samer and Sebastián Urrutia
Building an iterative heuristic solver for a quantum annealer pp. 845-869 Downloads
Gili Rosenberg, Mohammad Vazifeh, Brad Woods and Eldad Haber

Volume 65, issue 2, 2016

Guest editorial pp. 309-311 Downloads
Gianni Di Pillo and Massimo Roma
Central axes and peripheral points in high dimensional directional datasets pp. 313-338 Downloads
Annabella Astorino, Manlio Gaudioso and Alberto Seeger
On the update of constraint preconditioners for regularized KKT systems pp. 339-360 Downloads
Stefania Bellavia, Valentina De Simone, Daniela di Serafino and Benedetta Morini
A DIRECT-type approach for derivative-free constrained global optimization pp. 361-397 Downloads
G. Di Pillo, G. Liuzzi, S. Lucidi, V. Piccialli and F. Rinaldi
A novel class of approximate inverse preconditioners for large positive definite linear systems in optimization pp. 399-429 Downloads
Giovanni Fasano and Massimo Roma
Improved error bound and a hybrid method for generalized Nash equilibrium problems pp. 431-448 Downloads
Axel Dreves
Exploiting derivative-free local searches in DIRECT-type algorithms for global optimization pp. 449-475 Downloads
G. Liuzzi, S. Lucidi and V. Piccialli
Solving uniform coverage problem with a modified Remez-algorithm pp. 477-491 Downloads
D. Nowak and K. H. Küfer
Reduction of affine variational inequalities pp. 493-509 Downloads
Stephen M. Robinson
Perfectly competitive capacity expansion games with risk-averse participants pp. 511-539 Downloads
Dane A. Schiro, Benjamin F. Hobbs and Jong-Shi Pang

Volume 65, issue 1, 2016

A two-level approach to large mixed-integer programs with application to cogeneration in energy-efficient buildings pp. 1-46 Downloads
Fu Lin, Sven Leyffer and Todd Munson
A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in n-space pp. 47-71 Downloads
Marcia Fampa, Jon Lee and Wendel Melo
Integer programming models and branch-and-cut approaches to generalized {0,1,2}-survivable network design problems pp. 73-92 Downloads
Markus Leitner
On the global convergence of the inexact semi-smooth Newton method for absolute value equation pp. 93-108 Downloads
J. Y. Bello Cruz, O. P. Ferreira and L. F. Prudente
New results on subgradient methods for strongly convex optimization problems with a unified analysis pp. 127-172 Downloads
Masaru Ito
Nonconvex bundle method with application to a delamination problem pp. 173-203 Downloads
Minh N. Dao, Joachim Gwinner, Dominikus Noll and Nina Ovcharova
Global minima for semilinear optimal control problems pp. 261-288 Downloads
Ahmad Ahmad Ali, Klaus Deckelnick and Michael Hinze
A proximal point algorithm based on decomposition method for cone constrained multiobjective optimization problems pp. 289-308 Downloads
Jiawei Chen, Qamrul Hasan Ansari, Yeong-Cheng Liou and Jen-Chih Yao
Page updated 2023-05-30