Nonmonotone strategy for minimization of quadratics with simple constraints.
From MaRDI portal
Publication:1771833
DOI10.1023/A:1013752209845zbMath1066.65065MaRDI QIDQ1771833
José Mario Martínez, Zdeněk Dostál, Maria A. Diniz-Ehrhardt, Márcia Ap. Gomes-Ruggiero, Sandra Augusta Santos
Publication date: 19 April 2005
Published in: Applications of Mathematics (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/33090
convergencequadratic programmingnumerical experimentsprojection methodconjugate gradientsactive set methods
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Methods of reduced gradient type (90C52)
Related Items (4)
A Solver for Nonconvex Bound-Constrained Quadratic Optimization ⋮ Optimal iterative QP and QPQC algorithms ⋮ Superrelaxation and the rate of convergence in minimizing quadratic functions subject to bound constraints ⋮ Augmented Lagrangian algorithms based on the spectral projected gradient method for solving nonlinear programming problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A direct active set algorithm for large sparse quadratic programs with simple bounds
- Solving the minimal least squares problem subject to bounds on the variables
- An alternating direction implicit algorithm for the solution of linear complementarity problems arising from free boundary problems
- A sparse sequential quadratic programming algorithm
- A block active set algorithm for large-scale quadratic programming with box constraints
- A new trust region algorithm for bound constrained minimization
- Solution of contact problems by FETI domain decomposition with natural coarse space projections
- Numerical analysis of leaving-face parameters in bound-constrained quadratic minimization
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Numerical Simulation of Time-Dependent Contact and Friction Problems in Rigid Body Mechanics
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
- On the Maximization of a Concave Quadratic Function with Box Constraints
- CUTE
- Box Constrained Quadratic Programming with Proportioning and Projections
- On the numerical solution of bound constrained optimization problems
- Projected Newton Methods for Optimization Problems with Simple Constraints
- On the Barzilai and Borwein choice of steplength for the gradient method
- Methods of conjugate gradients for solving linear systems
This page was built for publication: Nonmonotone strategy for minimization of quadratics with simple constraints.
