On a primal-dual Newton proximal method for convex quadratic programs
type: Item
instance of: scholarly article
title: On a primal-dual Newton proximal method for convex quadratic programs
zbMATH Open document ID: 1487.90511
author: A. de Marchi
published in: Computational Optimization and Applications
publication date: 2022-03-15T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C53
zbMATH DE Number: 7490077
zbMATH Keywords: semismooth Newton method
zbMATH Keywords: proximal point method
zbMATH Keywords: regularized primal-dual method
zbMATH Keywords: convex quadratic programming
describes a project that uses: NASOQ
describes a project that uses: SuperMann
describes a project that uses: Gurobi
describes a project that uses: Mosek
describes a project that uses: ALGENCAN
describes a project that uses: OSQP
describes a project that uses: Benchmarks for Optimization Software
describes a project that uses: NETLIB LP Test Set
describes a project that uses: SCS
describes a project that uses: CHOLMOD
describes a project that uses: QPALM
describes a project that uses: qpOASES
describes a project that uses: FBstab
MaRDI profile type: Publication
full work available at URL: s10589-021-00342-y
OpenAlex ID: W4206004106
cites work: A globally and quadratically convergent primal–dual augmented Lagrangian algorithm for equality constrained optimization
cites work: A Regularized Factorization-Free Method for Equality-Constrained Optimization
cites work: Infeasibility detection in the alternating direction method of multipliers for convex optimization
cites work: On the asymptotic behavior of the Douglas-Rachford and proximal-point algorithms for convex optimization
cites work: A Numerically Stable Solver for Positive Semidefinite Quadratic Programs Based on Nonnegative Least Squares
cites work: Q3690580
cites work: Practical Augmented Lagrangian Methods for Constrained Optimization
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Q4821526
cites work: A penalized Fischer-Burmeister NCP-function
cites work: A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
cites work: Multiple-rank modifications of a sparse Cholesky factorization
cites work: The Proximal Augmented Lagrangian Method for Nonsmooth Composite Optimization
cites work: Benchmarking optimization software with performance profiles.
cites work: Implicit Functions and Solution Mappings
cites work: qpOASES: a parametric active-set algorithm for~quadratic programming
cites work: A special newton-type optimization method
cites work: A primal-dual regularized interior-point method for convex quadratic programs
cites work: Exact Regularization of Convex Programs
cites work: A nonsmooth Newton's method for discretized optimal control problems with state and control constraints
cites work: Methods for Modifying Matrix Factorizations
cites work: A primal-dual augmented Lagrangian
cites work: A Globally Convergent Stabilized SQP Method
cites work: Interior point methods 25 years later
cites work: A Note on Performance Profiles for Benchmarking Software
cites work: Numerical methods for large-scale nonlinear optimization
cites work: The Primal-Dual Active Set Strategy as a Semismooth Newton Method
cites work: Newton-Type Methods for Optimization and Variational Problems
cites work: FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming
cites work: Asymptotic Convergence Analysis of the Proximal Point Algorithm
cites work: A repository of convex quadratic programming problems
cites work: Monotone (nonlinear) operators in Hilbert space
cites work: Benchmarking Derivative-Free Optimization Algorithms
cites work: Q5491447
cites work: Primal-Dual Decomposition by Operator Splitting and Applications to Image Deblurring
cites work: Conic optimization via operator splitting and homogeneous self-dual embedding
cites work: Error bounds in mathematical programming
cites work: An Accelerated Dual Gradient-Projection Algorithm for Embedded Linear Model Predictive Control
cites work: Global Newton-type methods and semismooth reformulations for NCP
cites work: An interior point-proximal method of multipliers for convex quadratic programming
cites work: Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
cites work: A nonsmooth version of Newton's method
cites work: Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: Q4235027
cites work: OSQP: An Operator Splitting Solver for Quadratic Programs
cites work: On NCP-functions
cites work: On piecewise quadratic Newton and trust region problems
cites work: SuperMann: A Superlinearly Convergent Algorithm for Finding Fixed Points of Nonexpansive Operators

On a primal-dual Newton proximal method for convex quadratic programs (cites work)
cites work: Symmetric Quasidefinite Matrices

On a primal-dual Newton proximal method for convex quadratic programs (cites work)
cites work: The Simplex Method for Quadratic Programming

On a primal-dual Newton proximal method for convex quadratic programs (DOI)
DOI: 10.1007/S10589-021-00342-Y