On a primal-dual Newton proximal method for convex quadratic programs
From MaRDI portal
Publication:2114815
Recommendations
- Primal-dual method of solving convex quadratic programming problems
- Primal and dual active-set methods for convex quadratic programming
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- OSQP: an operator splitting solver for quadratic programs
- A primal-dual regularized interior-point method for convex quadratic programs
Cites work
- scientific article; zbMATH DE number 3914081 (Why is no real title available?)
- scientific article; zbMATH DE number 1266748 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 5060482 (Why is no real title available?)
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- A Globally Convergent Stabilized SQP Method
- A Numerically Stable Solver for Positive Semidefinite Quadratic Programs Based on Nonnegative Least Squares
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- A nonsmooth Newton's method for discretized optimal control problems with state and control constraints
- A nonsmooth version of Newton's method
- A note on performance profiles for benchmarking software
- A penalized Fischer-Burmeister NCP-function
- A primal-dual augmented Lagrangian
- A primal-dual regularized interior-point method for convex quadratic programs
- A regularized factorization-free method for equality-constrained optimization
- A repository of convex quadratic programming problems
- A special newton-type optimization method
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- An interior point-proximal method of multipliers for convex quadratic programming
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Benchmarking Derivative-Free Optimization Algorithms
- Benchmarking optimization software with performance profiles.
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Error bounds in mathematical programming
- Exact Regularization of Convex Programs
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- Global Newton-type methods and semismooth reformulations for NCP
- Implicit Functions and Solution Mappings
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Interior point methods 25 years later
- Methods for Modifying Matrix Factorizations
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Multiple-rank modifications of a sparse Cholesky factorization
- Newton-Type Methods for Optimization and Variational Problems
- Numerical methods for large-scale nonlinear optimization
- OSQP: an operator splitting solver for quadratic programs
- On NCP-functions
- On piecewise quadratic Newton and trust region problems
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
- Practical augmented Lagrangian methods for constrained optimization
- Primal-dual decomposition by operator splitting and applications to image deblurring
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
- Symmetric Quasidefinite Matrices
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- The Simplex Method for Quadratic Programming
- qpOASES: a parametric active-set algorithm for~quadratic programming
Cited in
(11)- Constrained composite optimization and augmented Lagrangian methods
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints
- Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques
- Convergence of the primal-dual Newton method for linear programming problems
- Globally convergent primal-dual active-set methods with inexact subproblem solves
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization
- OSQP: an operator splitting solver for quadratic programs
- QPDO
- A dual Newton strategy for tree-sparse quadratic programs and its implementation in the open-source software treeQP
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
Describes a project that uses
Uses Software
This page was built for publication: On a primal-dual Newton proximal method for convex quadratic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2114815)
