Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Applied Mathematics and Optimization Springer Journals

Subspace Barzilai-Borwein Gradient Method for Large-Scale Bound Constrained Optimization

Download PDF
16 pages

Loading next page...
 
/lp/springer-journals/subspace-barzilai-borwein-gradient-method-for-large-scale-bound-zTN1Pe0ocO
Publisher
Springer Journals
Copyright
Copyright © 2008 by Springer Science+Business Media, LLC
Subject
Mathematics; Numerical and Computational Methods ; Mathematical Methods in Physics; Mathematical and Computational Physics; Systems Theory, Control; Calculus of Variations and Optimal Control; Optimization
ISSN
0095-4616
eISSN
1432-0606
DOI
10.1007/s00245-008-9038-9
Publisher site
See Article on Publisher Site

Abstract

An active set subspace Barzilai-Borwein gradient algorithm for large-scale bound constrained optimization is proposed. The active sets are estimated by an identification technique. The search direction consists of two parts: some of the components are simply defined; the other components are determined by the Barzilai-Borwein gradient method. In this work, a nonmonotone line search strategy that guarantees global convergence is used. Preliminary numerical results show that the proposed method is promising, and competitive with the well-known method SPG on a subset of bound constrained problems from CUTEr collection.

Journal

Applied Mathematics and Optimization – Springer Journals

Published: Oct 1, 2008

References

  • On augmented Lagrangian methods with general lower-level constraints
    Andreani, R.; Birgin, E.G.; Martínez, J.M.; Schuverdt, M.L.
  • Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
    Andreani, R.; Birgin, E.G.; Martínez, J.M.; Schuverdt, M.L.
  • Two point step size gradient method
    Barzilai, J.; Borwein, J.M.
  • Projected Newton methods for optimization problems with simple constrains
    Bertsekas, D.P.
  • Large-scale active-set box-constrained optimization method with spectral projected gradients
    Birgin, E.G.; Martínez, J.M.
  • Nonmonotone spectral projected gradient methods on convex sets
    Birgin, E.G.; Martínez, J.M.; Raydan, M.
  • Algorithm 813: SPG—software for convex-constrained optimization
    Birgin, E.G.; Martínez, J.M.; Raydan, M.
  • Inexact spectral projected gradient methods on convex sets
    Birgin, E.G.; Martínez, J.M.; Raydan, M.
  • A limited memory multipoint secant method for bound constrained optimization
    Burdakov, O.P.; Martínez, J.M.; Pilotta, E.A.
  • A limited memory algorithm for bound constrained optimization
    Byrd, R.H.; Lu, P.H.; Nocedal, J.
  • Global convergence of a class of trust region algorithm for optimization with simple bounds
    Conn, A.R.; Gould, N.I.M.; Toint, Ph.L.
  • A globally convergent augmented Lagrangean algorithm for optimization with general constraints and simple bounds
    Conn, A.R.; Gould, N.I.M.; Toint, Ph.L.
  • CUTE: constrained and unconstrained testing environment
    Conn, A.R.; Gould, N.I.M.; Toint, Ph.L.
  • Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
    Dai, Y.H.; Fletcher, R.
  • On the asymptotic behaviour of some new gradient methods
    Dai, Y.H.; Fletcher, R.
  • R-linear convergence of the Barzilai and Borwein gradient method
    Dai, Y.H.; Liao, L.Z.
  • Modified two-point stepsize gradient methods for unconstrained optimization
    Dai, Y.H.; Yuan, J.Y.; Yuan, Y.
  • The cyclic Barzilai-Borwein method for unconstrained optimization
    Dai, Y.H.; Hager, W.W.; Schittkowski, K.; Zhang, H.
  • Augmented Lagrangian algorithm based on the spectral projected gradient for solving nonlinear programming problems
    Diniz-Ehrhardt, M.A.; Gomes-Ruggiero, M.A.; Martínez, J.M.; Santos, S.A.
  • Benchmarking optimization software with performance profiles
    Dolan, E.D.; Moré, J.J.
  • An active set Newton’s algorithm for large-scale nonlinear programs with box constraints
    Facchinei, F.; Júdice, J.; Soares, J.
  • A truncated Newton algorithm for large scale box constrained optimization
    Facchinei, F.; Lucidi, S.; Palagi, L.
  • Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
    Grippo, L.; Sciandrone, M.
  • A nonmonotone line search technique for Newton’s method
    Grippo, L.; Lampariello, F.; Lucidi, S.
  • Extension of Davidon’s variable metric algorithm to maximization under linear inequality and constraints
    Goldfarb, D.
  • Toint, Numerical methods for large-scale nonlinear optimization
    Gould, N.I.M.; Orban, D.; L, Ph.
  • A new active set algorithm for box constrained optimization
    Hager, W.W.; Zhang, H.
  • Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
    Krejić, N.; Martínez, J.M.; Mello, M.P.; Pilotta, E.A.
  • Introduction to Linear and Nonlinear Programming
    Luenberger, D.G.
  • BOX-QUACAN and the implementation of Augmented Lagrangian algorithms for minimization with inequality constraints
    Martínez, J.M.
  • A subspace limited memory quasi-Newton algorithm for large-scale nonlinear bound constrained optimization
    Ni, Q.; Yuan, Y.
  • On the Barzilai and Borwein gradient method for the large scale unconstrained minimization problem
    Raydan, M.
  • The Barzilai and Borwein gradient method for the large scale unconstrained minimization problem
    Raydan, M.
  • A nonmonotone line search technique and its application to unconstrained optimization
    Zhang, H.; Hager, W.W.