QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs
From MaRDI portal
Publication:2088967
DOI10.1007/s12532-022-00218-0zbMath1496.90032arXiv2010.02653OpenAlexW3092426941MaRDI QIDQ2088967
Andreas Themelis, Panagiotis Patrinos, Ben Hermans
Publication date: 6 October 2022
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2010.02653
semismooth Newton methodfactorization updatesproximal augmented Lagrangianexact linesearchnonconvex QPs
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Newton-type methods (49M15) Linear programming (90C05) Set-valued and variational analysis (49J53)
Related Items
LADEL, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, Theoretical characteristics and numerical methods for a class of special piecewise quadratic optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- OSQP: An Operator Splitting Solver for Quadratic Programs
- qpOASES: a parametric active-set algorithm for~quadratic programming
- A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
- Newton-KKT interior-point methods for indefinite quadratic programming
- On affine scaling algorithms for nonconvex quadratic programming
- Convexification procedures and decomposition methods for nonconvex optimization problems
- Error bounds and convergence analysis of feasible descent methods: A general approach
- Globally solving nonconvex quadratic programming problems via completely positive programming
- A reformulation-convexification approach for solving nonconvex quadratic programming problems
- Infeasibility detection in the alternating direction method of multipliers for convex optimization
- CUTEst: a constrained and unconstrained testing environment with safe threads for mathematical optimization
- Methods for convex and general quadratic programming
- A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On classes of copositive matrices
- Multiple-Rank Modifications of a Sparse Cholesky Factorization
- Toward the Optimal Preconditioned Eigensolver: Locally Optimal Block Preconditioned Conjugate Gradient Method
- Numerical solution of saddle point problems
- Direct Methods for Sparse Linear Systems
- Global Convergence of Splitting Methods for Nonconvex Composite Optimization
- Algorithm 849
- Implicit Functions and Solution Mappings
- Computing the Minimum Fill-In is NP-Complete
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Modifying a Sparse Cholesky Factorization
- Variational Analysis
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- The BPMPD interior point solver for convex quadratic problems
- A repository of convex quadratic programming problems
- Proximal Methods for Cohypomonotone Operators
- Symmetric Quasidefinite Matrices
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates
- Douglas--Rachford Splitting and ADMM for Nonconvex Optimization: Tight Convergence Results
- Nonconvex Lagrangian-Based Optimization: Monitoring Schemes and Global Convergence
- Complexity of a Quadratic Penalty Accelerated Inexact Proximal Point Method for Solving Linearly Constrained Nonconvex Composite Programs
- A Note on Performance Profiles for Benchmarking Software
- Row Modifications of a Sparse Cholesky Factorization
- Object-oriented software for quadratic programming
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- Algorithm 837
- Practical Augmented Lagrangian Methods for Constrained Optimization
- Benchmarking optimization software with performance profiles.
