Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
From MaRDI portal
(Redirected from Publication:849145)
Recommendations
Cites work
- A generalized two-point ellipsoidal anisotropic ray tracing for converted waves
- A Globally Convergent Filter Method for Nonlinear Programming
- A new stepsize for the steepest descent method
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A Nonmonotone Line Search Technique for Newton’s Method
- A numerically stable dual method for solving strictly convex quadratic programs
- A tolerant algorithm for linearly constrained optimization calculations
- Adaptive two-point stepsize gradient algorithm
- Algorithm 813
- Alternate step gradient method*
- An Assessment of Nonmonotone Linesearch Techniques for Unconstrained Optimization
- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Automatic differentiation and spectral projected gradient methods for optimal control problems
- Benchmarking optimization software with performance profiles.
- Convergence Properties of an Augmented Lagrangian Algorithm for Optimization with a Combination of General Equality and Linear Constraints
- Convergence properties of inexact projected gradient methods
- Convergence properties of nonmonotone spectral projected gradient methods
- Convex programming in Hilbert space
- CUTE
- Efficiently Converging Minimization Methods Based on the Reduced Gradient
- Gradient Method with Retards and Generalizations
- Gradient projection methods for quadratic programs and applications in training support vector machines
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- scientific article; zbMATH DE number 3257595 (Why is no real title available?)
- scientific article; zbMATH DE number 2221955 (Why is no real title available?)
- Inexact spectral projected gradient methods on convex sets
- Inexact-restoration algorithm for constrained optimization
- Inexact-restoration method with Lagrangian tangent decrease and new merit function for nonlinear programming.
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Large-scale linearly constrained optimization
- Méthode du GRG, méthode de Newton globale et application à la programmation mathématique
- Methods for Modifying Matrix Factorizations
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- Nonmonotone derivative-free methods for nonlinear equations
- Nonmonotone globalization techniques for the Barzilai-Borwein gradient method
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- On the asymptotic behaviour of some new gradient methods
- On the Barzilai and Borwein choice of steplength for the gradient method
- On the Goldstein-Levitin-Polyak gradient projection method
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the quadratic programming algorithm of Goldfarb and Idnani
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- Projected Barzilai-Borwein methods for large-scale box-constrained quadratic programming
- Relaxed steepest descent and Cauchy-Barzilai-Borwein method
- Spectral gradient methods for linearly constrained optimization
- Spectral gradient projection method for solving nonlinear monotone equations
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Spectral projected gradient method with inexact restoration for minimization with nonconvex constraints
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- The Barzilai and Borwein Gradient Method for the Large Scale Unconstrained Minimization Problem
- The cyclic Barzilai-–Borwein method for unconstrained optimization
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- Two-Point Step Size Gradient Methods
- Une modification de la méthode GRG
Cited in
(14)- Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- Asymptotic rate of convergence of a two-layer iterative method of the variational type
- Optimality properties of an augmented Lagrangian method on infeasible problems
- Spectral gradient methods for linearly constrained optimization
- scientific article; zbMATH DE number 1694901 (Why is no real title available?)
- On regularization and active-set methods with complexity for constrained optimization
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- Inexact variable metric method for convex-constrained optimization problems
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- On the stationarity for nonlinear optimization problems with polyhedral constraints
- Global convergence of dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
- Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
This page was built for publication: Partial spectral projected gradient method with active-set strategy for linearly constrained optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q849145)
