A dual gradient-projection method for large-scale strictly convex quadratic problems
From MaRDI portal
Publication:2012229
DOI10.1007/S10589-016-9886-1zbMath1401.90142OpenAlexW2558001808MaRDI QIDQ2012229
Nicholas I. M. Gould, Daniel P. Robinson
Publication date: 28 July 2017
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-016-9886-1
quadratic programmingconvex optimizationlarge-scale optimizationgradient projectiondual methodsparse factorizations
Related Items (3)
A modified subgradient extragradient method for solving the variational inequality problem ⋮ QPLIB: a library of quadratic programming instances ⋮ DQP
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Primal and dual active-set methods for convex quadratic programming
- On iterative algorithms for linear least squares problems with bound constraints
- QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming
- On fast factorization pivoting methods for sparse symmetric indefinite systems
- Optimal quadratic programming algorithms. With applications to variational inequalities
- Numeric computation of the projection of a point onto a polyhedron
- Representations of quasi-Newton matrices and their use in limited memory methods
- A sparse nonlinear optimization algorithm
- A dual-active-set algorithm for positive semi-definite quadratic programming
- A primal-dual regularized interior-point method for convex quadratic programs
- Minimizing quadratic functions subject to bound constraints with the rate of convergence and finite termination
- Dual fast projected gradient method for quadratic programming
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- A primal-dual interior-point algorithm for quadratic programming
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- Globally Convergent Primal-Dual Active-Set Methods with Inexact Subproblem Solves
- Subspace Accelerated Matrix Splitting Algorithms for Asymmetric and Symmetric Linear Complementarity Problems
- An Inexact Sequential Quadratic Optimization Algorithm for Nonlinear Optimization
- An out-of-core sparse Cholesky solver
- A Second Derivative SQP Method: Global Convergence
- A Modified Limited SQP Method For Constrained Optimization
- Duality in quadratic programming
- Numerical solution of saddle point problems
- A Solver for Nonconvex Bound-Constrained Quadratic Optimization
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On the Location of Directions of Infinite Descent for Nonlinear Programming Algorithms
- Projected gradient methods for linearly constrained problems
- Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- Matrix augmentation and partitioning in the updating of the basis inverse
- Primal-Dual Projected Gradient Algorithms for Extended Linear-Quadratic Programming
- LOQO:an interior point code for quadratic programming
- Trust Region Methods
- Global and Finite Termination of a Two-Phase Augmented Lagrangian Filter Method for General Quadratic Programs
- MA57---a code for the solution of sparse symmetric definite and indefinite systems
This page was built for publication: A dual gradient-projection method for large-scale strictly convex quadratic problems
