An iterative working-set method for large-scale nonconvex quadratic programming
From MaRDI portal
(Redirected from Publication:1862010)
quadratic programmingnonconvexpreconditioninglarge-scaleconjugate gradient methodactive-set methodLanczos methodsFortran 90 package QPAGALAHAD library
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Iterative numerical methods for linear systems (65F10) Numerical computation of matrix norms, conditioning, scaling (65F35) Methods of reduced gradient type (90C52)
Recommendations
- An Algorithm for Large-Scale Quadratic Programming
- Methods for convex and general quadratic programming
- An interior point method for general large-scale quadratic programming problems
- scientific article; zbMATH DE number 1086747
- On the Solution of Large Quadratic Programming Problems with Bound Constraints
Cites work
- scientific article; zbMATH DE number 3497901 (Why is no real title available?)
- scientific article; zbMATH DE number 1243473 (Why is no real title available?)
- scientific article; zbMATH DE number 741123 (Why is no real title available?)
- scientific article; zbMATH DE number 3793774 (Why is no real title available?)
- scientific article; zbMATH DE number 4197288 (Why is no real title available?)
- A model algorithm for composite nondifferentiable optimization problems
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A quadratic programming algorithm using conjugate search directions
- Accurate Symmetric Indefinite Linear Equation Solvers
- Augmentability in optimization theory
- Definiteness and semidefiniteness of quadratic forms revisited
- Direct Methods for Solving Symmetric Indefinite Systems of Linear Equations
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
- Factorizing symmetric indefinite matrices
- Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space
- Inertia-Controlling Methods for General Quadratic Programming
- Inertia-controlling factorizations for optimization algorithms
- Matrix augmentation and partitioning in the updating of the basis inverse
- Methods for Modifying Matrix Factorizations
- Methods of conjugate gradients for solving linear systems
- Newton Methods for Large-Scale Linear Equality-Constrained Minimization
- On Modified Factorizations for Large-Scale Linearly Constrained Optimization
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Preprocessing for quadratic programming
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Projected gradient methods for linearly constrained problems
- Solving the Trust-Region Subproblem using the Lanczos Method
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- The conjugate gradient method in extremal problems
Cited in
(9)- Global optimization of truss topology with discrete bar areas. I: Theory of relaxed problems
- QPLIB: a library of quadratic programming instances
- Adaptive tetrahedral meshing in free-surface flow
- Primal and dual active-set methods for convex quadratic programming
- QPA
- An Active-Set Method for Quadratic Programming Based On Sequential Hot-Starts
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- Methods for convex and general quadratic programming
This page was built for publication: An iterative working-set method for large-scale nonconvex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1862010)
