default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 60
Volume 60, Number 1, January 2015
- Luigi Grippo, Francesco Rinaldi
:
A class of derivative-free nonmonotone optimization algorithms employing coordinate rotations and gradient approximations. 1-33 - Tommaso Bianconcini, Giampaolo Liuzzi, Benedetta Morini, Marco Sciandrone:
On the use of iterative methods in cubic regularization for unconstrained optimization. 35-57 - Alfred Auslender, Alberto Ferrer, Miguel A. Goberna, Marco A. López:
Comparative study of RPSALG algorithm for convex semi-infinite programming. 59-87 - Mehiddin Al-Baali, Yasushi Narushima, Hiroshi Yabe:
A family of three-term conjugate gradient methods with sufficient descent property for unconstrained optimization. 89-110 - Alexey F. Izmailov, Alexey S. Kurennoy, Mikhail V. Solodov:
Local convergence of the method of multipliers for variational and optimization problems under the noncriticality assumption. 111-140 - Minglu Ye, Yiran He:
A double projection method for solving variational inequalities without monotonicity. 141-150 - David Di Lorenzo, Alessandro Galligari, Marco Sciandrone:
A convergent and efficient decomposition method for the traffic assignment problem. 151-170 - Jiming Peng, Tao Zhu, Hezhi Luo, Kim-Chuan Toh:
Semi-definite programming relaxation of quadratic assignment problems based on nonredundant matrix splitting. 171-198 - Eric Newby, M. Montaz Ali:
A trust-region-based derivative free algorithm for mixed integer programming. 199-229 - Lorenzo Contento, Alexandre Ern, Rossana Vermiglio:
A linear-time approximate convex envelope algorithm using the double Legendre-Fenchel transform with application to phase separation. 231-261 - Asghar Mahdavi, Mohammad Ebrahim Shiri:
An augmented Lagrangian ant colony based method for constrained optimization. 263-276
Volume 60, Number 2, March 2015
- Cong D. Dang, Guanghui Lan:
On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators. 277-310 - Frank E. Curtis, Zheng Han, Daniel P. Robinson:
A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization. 311-341 - Elizabeth W. Karas, Sandra A. Santos, Benar Fux Svaiter:
Algebraic rules for quadratic regularization of Newton's method. 343-376 - Anders Forsgren, Tove Odland:
On the connection between the conjugate gradient method and quasi-Newton methods on quadratic problems. 377-392 - Johannes Jahn:
A derivative-free descent method in set optimization. 393-411 - Fahimeh Biglari, Ali Ebadian:
Limited memory BFGS method based on a high-order tensor model. 413-422 - Ioannis K. Argyros, Ángel Alberto Magreñán:
Improved local convergence analysis of the Gauss-Newton method under a majorant condition. 423-439 - Luke R. Mason, Vicky H. Mak-Hau, Andreas T. Ernst:
A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning. 441-477 - Álvaro Rubio-Largo, Miguel A. Vega-Rodríguez, David L. González-Álvarez:
Multiobjective swarm intelligence for the traffic grooming problem. 479-511 - Xiaosheng Li, Guoshan Zhang:
Minimum penalty for constrained evolutionary optimization. 513-544
Volume 60, Number 3, April 2015
- Nicholas I. M. Gould, Dominique Orban, Philippe L. Toint:
CUTEst: a Constrained and Unconstrained Testing Environment with safe threads for mathematical optimization. 545-557 - Kuo-Ling Huang, Sanjay Mehrotra:
An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs. 559-585 - Qi Huangfu, J. A. Julian Hall:
Novel update techniques for the revised simplex method. 587-608 - Ernesto G. Birgin, José Mario Martínez, Leandro da Fonseca Prudente:
Optimality properties of an Augmented Lagrangian method on infeasible problems. 609-631 - Qihang Lin, Lin Xiao:
An adaptive accelerated proximal gradient method and its homotopy continuation for sparse optimization. 633-674 - Ping Jin, Chen Ling, Huifei Shen:
A smoothing Levenberg-Marquardt algorithm for semi-infinite programming. 675-695 - Xiuhua Wang, Jisheng Kou:
Convergence analysis on a class of improved Chebyshev methods for nonlinear equations in Banach spaces. 697-717 - Konstantinos Chrysafinos, Efthimios N. Karatzas:
Symmetric error estimates for discontinuous Galerkin time-stepping schemes for optimal control problems constrained to evolutionary Stokes equations. 719-751 - Markus A. Dihlmann, Bernard Haasdonk:
Certified PDE-constrained parameter optimization using reduced basis surrogate models for evolution problems. 753-787 - Behrooz Koohestani, Riccardo Poli:
Addressing the envelope reduction of sparse matrices using a genetic programming system. 789-814
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-08-11 00:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
