Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
From MaRDI portal
Publication:849145
DOI10.1007/s11075-009-9289-9zbMath1185.65096OpenAlexW2016189650MaRDI QIDQ849145
Marina Andretta, Ernesto G. Birgin, José Mario Martínez
Publication date: 24 February 2010
Published in: Numerical Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11075-009-9289-9
Related Items
Inexact variable metric method for convex-constrained optimization problems, Partial spectral projected gradient method with active-set strategy for linearly constrained optimization, On the stationarity for nonlinear optimization problems with polyhedral constraints, Global minimization using an augmented Lagrangian method with variable lower-level constraints, On Regularization and Active-set Methods with Complexity for Constrained Optimization, Asymptotic rate of convergence of a two-layer iterative method of the variational type, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Optimality properties of an augmented Lagrangian method on infeasible problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A numerically stable dual method for solving strictly convex quadratic programs
- Convergence properties of nonmonotone spectral projected gradient methods
- A generalized two-point ellipsoidal anisotropic ray tracing for converted waves
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- A tolerant algorithm for linearly constrained optimization calculations
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Inexact-restoration algorithm for constrained optimization
- Nonmonotone derivative-free methods for nonlinear equations
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On the asymptotic behaviour of some new gradient methods
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Spectral gradient projection method for solving nonlinear monotone equations
- Spectral gradient methods for linearly constrained optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Méthode du GRG, méthode de Newton globale et application à la programmation mathématique
- Convergence properties of inexact projected gradient methods
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints
- On the quadratic programming algorithm of Goldfarb and Idnani
- Two-Point Step Size Gradient Methods
- On the Goldstein-Levitin-Polyak gradient projection method
- Efficiently Converging Minimization Methods Based on the Reduced Gradient
- Large-scale linearly constrained optimization
- Une modification de la méthode GRG
- Gradient Method with Retards and Generalizations
- CUTE
- Inexact spectral projected gradient methods on convex sets
- Alternate step gradient method*
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- A Globally Convergent Filter Method for Nonlinear Programming
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- A Nonmonotone Line Search Technique for Newton’s Method
- Methods for Modifying Matrix Factorizations
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Automatic differentiation and spectral projected gradient methods for optimal control problems
- On the Barzilai and Borwein choice of steplength for the gradient method
- Gradient projection methods for quadratic programs and applications in training support vector machines
- Algorithm 813
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- Convex programming in Hilbert space
- Benchmarking optimization software with performance profiles.
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Adaptive two-point stepsize gradient algorithm
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
