On a primal-dual Newton proximal method for convex quadratic programs
From MaRDI portal
Publication:2114815
DOI10.1007/S10589-021-00342-YzbMATH Open1487.90511OpenAlexW4206004106MaRDI QIDQ2114815FDOQ2114815
Authors: A. de Marchi 
Publication date: 15 March 2022
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-021-00342-y
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
proximal point methodconvex quadratic programmingsemismooth Newton methodregularized primal-dual method
Cites Work
- Practical Augmented Lagrangian Methods for Constrained Optimization
- FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
- OSQP: An Operator Splitting Solver for Quadratic Programs
- The Simplex Method for Quadratic Programming
- Methods for Modifying Matrix Factorizations
- Title not available (Why is that?)
- Distributed optimization and statistical learning via the alternating direction method of multipliers
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- Conic optimization via operator splitting and homogeneous self-dual embedding
- A repository of convex quadratic programming problems
- Symmetric Quasidefinite Matrices
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A Note on Performance Profiles for Benchmarking Software
- Title not available (Why is that?)
- Benchmarking optimization software with performance profiles.
- Title not available (Why is that?)
- Monotone (nonlinear) operators in Hilbert space
- A nonsmooth version of Newton's method
- An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Implicit Functions and Solution Mappings
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Interior point methods 25 years later
- Error bounds in mathematical programming
- Multiple-rank modifications of a sparse Cholesky factorization
- On NCP-functions
- A special newton-type optimization method
- A primal-dual regularized interior-point method for convex quadratic programs
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- Benchmarking Derivative-Free Optimization Algorithms
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- A primal-dual augmented Lagrangian
- Newton-Type Methods for Optimization and Variational Problems
- A Globally Convergent Stabilized SQP Method
- Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
- A penalized Fischer-Burmeister NCP-function
- Numerical methods for large-scale nonlinear optimization
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- A nonsmooth Newton's method for discretized optimal control problems with state and control constraints
- Exact Regularization of Convex Programs
- Global Newton-type methods and semismooth reformulations for NCP
- A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
- The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
- On piecewise quadratic Newton and trust region problems
- An interior point-proximal method of multipliers for convex quadratic programming
- A Regularized Factorization-Free Method for Equality-Constrained Optimization
- On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
- A Numerically Stable Solver for Positive Semidefinite Quadratic Programs Based on Nonnegative Least Squares
- SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators
Cited In (6)
- Primal-dual Newton method with steepest descent for the linear semidefinite programming problem: Newton's system of equations
- 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
- QPDO
- Convergence of the primal-dual Newton method for linear programming problems
- Constrained composite optimization and augmented Lagrangian methods
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)
