EconPapers    
Economics at your fingertips  
 

Computational Optimization and Applications

2007 - 2015

Current editor(s): William W. Hager

from Springer
Series data maintained by Guenther Eichhorn ().

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 61, issue 1, 2015

Linear equalities in blackbox optimization pp. 1-23 Downloads
Charles Audet, Sébastien Le Digabel and Mathilde Peyrega
A derivative-free trust-funnel method for equality-constrained nonlinear optimization pp. 25-49 Downloads
Ph. Sampaio and Ph. Toint
An exterior point polynomial-time algorithm for convex quadratic programming pp. 51-78 Downloads
Da Tian
On the proximal Landweber Newton method for a class of nonsmooth convex problems pp. 79-99 Downloads
Hai-Bin Zhang, Jiao-Jiao Jiang and Yun-Bin Zhao
Reconstruction algorithm for unknown cavities via Feynman–Kac type formula pp. 101-133 Downloads
Hajime Kawakami
Legendre–Galerkin spectral methods for optimal control problems with integral constraint for state in one dimension pp. 135-158 Downloads
Jianwei Zhou and Danping Yang
A multistart iterated local search for the multitrip cumulative capacitated vehicle routing problem pp. 159-187 Downloads
Juan Rivera, Afsar H. and Christian Prins
A new algorithm for the minimum spanning tree verification problem pp. 189-204 Downloads
Matthew Williamson and Subramani K.
On heuristic bi-criterion methods for semi-obnoxious facility location pp. 205-217 Downloads
Ortigosa P., Hendrix E. and Redondo J.
An incremental clustering algorithm based on hyperbolic smoothing pp. 219-241 Downloads
Bagirov A., Ordin B., Ozturk G. and Xavier A.
Differential evolution using a superior–inferior crossover scheme pp. 243-274 Downloads
Yulong Xu, Jian-an Fang, Wu Zhu, Xiaopeng Wang and Lingdong Zhao

Volume 60, issue 3, 2015

CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization pp. 545-557 Downloads
Nicholas Gould, Dominique Orban and Philippe Toint
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs pp. 559-585 Downloads
Kuo-Ling Huang and Sanjay Mehrotra
Novel update techniques for the revised simplex method pp. 587-608 Downloads
Qi Huangfu and Hall J.
Optimality properties of an Augmented Lagrangian method on infeasible problems pp. 609-631 Downloads
Birgin E., Martínez J. and Prudente L.
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization pp. 633-674 Downloads
Qihang Lin and Lin Xiao
A smoothing Levenberg–Marquardt algorithm for semi-infinite programming pp. 675-695 Downloads
Ping Jin, Chen Ling and Huifei Shen
Convergence analysis on a class of improved Chebyshev methods for nonlinear equations in Banach spaces pp. 697-717 Downloads
Xiuhua Wang and Jisheng Kou
Symmetric error estimates for discontinuous Galerkin time-stepping schemes for optimal control problems constrained to evolutionary Stokes equations pp. 719-751 Downloads
Konstantinos Chrysafinos and Efthimios Karatzas
Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems pp. 753-787 Downloads
Markus Dihlmann and Bernard Haasdonk
Addressing the envelope reduction of sparse matrices using a genetic programming system pp. 789-814 Downloads
Behrooz Koohestani and Riccardo Poli

Volume 60, issue 2, 2015

On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators pp. 277-310 Downloads
Cong Dang and Guanghui Lan
A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization pp. 311-341 Downloads
Frank Curtis, Zheng Han and Daniel Robinson
Algebraic rules for quadratic regularization of Newton’s method pp. 343-376 Downloads
Elizabeth Karas, Sandra Santos and Benar Svaiter
On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems pp. 377-392 Downloads
Anders Forsgren and Tove Odland
A derivative-free descent method in set optimization pp. 393-411 Downloads
Johannes Jahn
Limited memory BFGS method based on a high-order tensor model pp. 413-422 Downloads
Fahimeh Biglari and Ali Ebadian
Improved local convergence analysis of the Gauss–Newton method under a majorant condition pp. 423-439 Downloads
Ioannis Argyros and Magreñán Á.
A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning pp. 441-477 Downloads
Luke Mason, Vicky Mak-Hau and Andreas Ernst
Multiobjective swarm intelligence for the traffic grooming problem pp. 479-511 Downloads
Álvaro Rubio-Largo, Miguel Vega-Rodríguez and David González-Álvarez
Minimum penalty for constrained evolutionary optimization pp. 513-544 Downloads
Xiaosheng Li and Guoshan Zhang

Volume 60, issue 1, 2015

A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations pp. 1-33 Downloads
Grippo L. and Rinaldi F.
On the use of iterative methods in cubic regularization for unconstrained optimization pp. 35-57 Downloads
Tommaso Bianconcini, Giampaolo Liuzzi, Benedetta Morini and Marco Sciandrone
Comparative study of RPSALG algorithm for convex semi-infinite programming pp. 59-87 Downloads
Auslender A., Ferrer A., Goberna M. and López M.
A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization pp. 89-110 Downloads
Mehiddin Al-Baali, Yasushi Narushima and Hiroshi Yabe
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption pp. 111-140 Downloads
Izmailov A., Kurennoy A. and Solodov M.
A double projection method for solving variational inequalities without monotonicity pp. 141-150 Downloads
Minglu Ye and Yiran He
A convergent and efficient decomposition method for the traffic assignment problem pp. 151-170 Downloads
David Di Lorenzo, Alessandro Galligari and Marco Sciandrone
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting pp. 171-198 Downloads
Jiming Peng, Tao Zhu, Hezhi Luo and Kim-Chuan Toh
A trust-region-based derivative free algorithm for mixed integer programming pp. 199-229 Downloads
Eric Newby and Ali M.
A linear-time approximate convex envelope algorithm using the double Legendre–Fenchel transform with application to phase separation pp. 231-261 Downloads
Lorenzo Contento, Alexandre Ern and Rossana Vermiglio
An augmented Lagrangian ant colony based method for constrained optimization pp. 263-276 Downloads
Asghar Mahdavi and Mohammad Shiri

Volume 59, issue 3, 2014

Study of a primal-dual algorithm for equality constrained minimization pp. 405-433 Downloads
Paul Armand, Joël Benoist, Riadh Omheni and Vincent Pateloup
Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization pp. 435-473 Downloads
Chungen Shen, Lei-Hong Zhang, Bo Wang and Wenqiong Shao
Sequential quadratic programming methods for parametric nonlinear optimization pp. 475-509 Downloads
Vyacheslav Kungurtsev and Moritz Diehl
An alternating extragradient method with non euclidean projections for saddle point problems pp. 511-540 Downloads
Silvia Bonettini and Valeria Ruggiero
An efficient gradient method using the Yuan steplength pp. 541-563 Downloads
Roberta De Asmundis, Daniela di Serafino, William Hager, Gerardo Toraldo and Hongchao Zhang
A variable fixing version of the two-block nonlinear constrained Gauss–Seidel algorithm for $$\ell _1$$ ℓ 1 -regularized least-squares pp. 565-589 Downloads
Margherita Porcelli and Francesco Rinaldi
Solving semi-infinite programs by smoothing projected gradient method pp. 591-616 Downloads
Mengwei Xu, Soon-Yi Wu and Jane Ye
A primal-dual aggregation algorithm for minimizing conditional value-at-risk in linear programs pp. 617-638 Downloads
Daniel Espinoza and Eduardo Moreno
Strong-branching inequalities for convex mixed integer nonlinear programs pp. 639-665 Downloads
Mustafa Kılınç, Jeff Linderoth, James Luedtke and Andrew Miller
Efficient parallel solution of large-scale nonlinear dynamic optimization problems pp. 667-688 Downloads
Daniel Word, Jia Kang, Johan Akesson and Carl Laird
An Eulerian–Lagrangian method for optimization problems governed by multidimensional nonlinear hyperbolic PDEs pp. 689-724 Downloads
Alina Chertock, Michael Herty and Alexander Kurganov
Hybridizing local search algorithms for global optimization pp. 725-748 Downloads
Morteza Ahandani, Mohammad-Taghi Vakil-Baghmisheh and Mohammad Talebi

Volume 59, issue 1, 2014

Preface pp. 1-4 Downloads
Xiaojun Chen and Nobuo Yamashita
A Levenberg-Marquardt method with approximate projections pp. 5-26 Downloads
Behling R., Fischer A., Herrich M., Iusem A. and Ye Y.
Faster, but weaker, relaxations for quadratically constrained quadratic programs pp. 27-45 Downloads
Samuel Burer, Sunyoung Kim and Masakazu Kojima
Convergence of the reweighted ℓ 1 minimization algorithm for ℓ 2 –ℓ p minimization pp. 47-61 Downloads
Xiaojun Chen and Weijun Zhou
A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application pp. 63-84 Downloads
Axel Dreves, Francisco Facchinei, Andreas Fischer and Markus Herrich
Non-cooperative games with minmax objectives pp. 85-112 Downloads
Francisco Facchinei, Jong-Shi Pang and Gesualdo Scutari
On an enumerative algorithm for solving eigenvalue complementarity problems pp. 113-134 Downloads
Luís Fernandes, Joaquim Júdice, Hanif Sherali and Maria Forjaz
Customized proximal point algorithms for linearly constrained convex minimization and saddle-point problems: a unified approach pp. 135-161 Downloads
Guoyong Gu, Bingsheng He and Xiaoming Yuan
An affine scaling method for optimization problems with polyhedral constraints pp. 163-183 Downloads
William Hager and Hongchao Zhang
Exact computational approaches to a stochastic uncapacitated single allocation p-hub center problem pp. 185-200 Downloads
Edward Hult, Houyuan Jiang and Daniel Ralph
On error bounds and Newton-type methods for generalized Nash equilibrium problems pp. 201-218 Downloads
Alexey Izmailov and Mikhail Solodov
Approximation methods for complex polynomial optimization pp. 219-248 Downloads
Bo Jiang, Zhening Li and Shuzhong Zhang
Convergence properties of the inexact Lin-Fukushima relaxation method for mathematical programs with complementarity constraints pp. 249-262 Downloads
Christian Kanzow and Alexandra Schwartz
A constrained optimization reformulation and a feasible descent direction method for $$L_{1/2}$$ L 1 / 2 regularization pp. 263-284 Downloads
Dong-Hui Li, Lei Wu, Zhe Sun and Xiong-ji Zhang
Optimal parameter selection for nonlinear multistage systems with time-delays pp. 285-306 Downloads
Chongyang Liu, Ryan Loxton and Kok Teo
Space tensor conic programming pp. 307-319 Downloads
Liqun Qi and Yinyu Ye
A regularized Newton method without line search for unconstrained optimization pp. 321-351 Downloads
Kenji Ueda and Nobuo Yamashita
A smoothing augmented Lagrangian method for solving simple bilevel programs pp. 353-377 Downloads
Mengwei Xu and Jane Ye
Successive convex approximations to cardinality-constrained convex programs: a piecewise-linear DC approach pp. 379-397 Downloads
Xiaojin Zheng, Xiaoling Sun, Duan Li and Jie Sun
Page updated 2015-04-24