Cover Image

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Hermans, Ben, Themelis, Andreas, Patrinos, Panagiotis
Format:	Preprint
Published:	2020
Subjects:	Optimization and Control 90C05, 90C20, 90C26, 49J53, 49M15
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

A quadratically convergent proximal algorithm for nonnegative tensor decomposition
by: Vervliet, Nico, et al.
Published: (2020)

PANOC-lite: A simpler and more efficient algorithm for composite minimization
by: Bodard, Alexander, et al.
Published: (2026)

A new envelope function for nonsmooth DC optimization
by: Themelis, Andreas, et al.
Published: (2020)

A mirror inertial forward-reflected-backward splitting: Global convergence and linesearch extension beyond convexity and Lipschitz smoothness
by: Wang, Ziyuan, et al.
Published: (2022)

A penalty barrier framework for nonconvex constrained optimization
by: De Marchi, Alberto, et al.
Published: (2024)

Variational analysis of unbounded and discontinuous generalized eigenvalue functions with application to topology optimization
by: Nishioka, Akatsuki, et al.
Published: (2024)

Lispchitz modulus of the argmin mapping in convex quadratic optimization
by: Cánovas, María Josefa, et al.
Published: (2025)

Generalized Metric Subregularity with Applications to High-Order Regularized Newton Methods
by: Li, Guoyin, et al.
Published: (2024)

Convergence Rates for the Alternating Minimization Algorithm in Structured Nonsmooth and Nonconvex Optimization
by: Bento, Glaydston C., et al.
Published: (2026)

Solving Indefinite Quadratic Programs by Dynamical Systems: Preliminary Investigations
by: Pappalardo, Massimo, et al.
Published: (2025)

Approximation Analysis of the Entropic Penalty in Quadratic Programming
by: Karumanchi, Venkatkrishna, et al.
Published: (2025)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Stationarity in nonsmooth optimization between geometrical motivation and topological relevance
by: Shikhman, Vladimir
Published: (2024)

Alternating Iteratively Reweighted $\ell_1$ and Subspace Newton Algorithms for Nonconvex Sparse Optimization
by: Wang, Hao, et al.
Published: (2024)

A Refined Proximal Algorithm for Nonconvex Multiobjective Optimization in Hilbert Spaces
by: Bento, G. C., et al.
Published: (2024)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

Lipschitz upper semicontinuity of linear inequality systems under full perturbations
by: Camacho, Jesús, et al.
Published: (2025)

Perturbation analysis of a class of composite optimization problems
by: Tang, Peipei, et al.
Published: (2024)

An Inexact Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong
Published: (2024)

Spingarn's Method and Progressive Decoupling Beyond Elicitable Monotonicity
by: Evens, Brecht, et al.
Published: (2025)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
by: Anstreicher, Kurt M., et al.
Published: (2025)

Characterizations of the Aubin property of the KKT-mapping in composite optimization by SC derivatives and quadratic bundles
by: Gfrerer, Helmut, et al.
Published: (2026)

A Stochastic Block-coordinate Proximal Newton Method for Nonconvex Composite Minimization
by: Zhu, Hong, et al.
Published: (2024)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
by: Lara, Felipe, et al.
Published: (2024)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
by: Marumo, Naoki, et al.
Published: (2026)

Nonmonotone subgradient methods based on a local descent lemma
by: Aragón-Artacho, Francisco J., et al.
Published: (2025)

On second-order optimality conditions for $C^{1,1}$ optimization problems via Lagrangian functions
by: An, Duong Thi Viet, et al.
Published: (2024)

Convergence of the Chambolle-Pock Algorithm in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)

Characterizations of the Aubin Property of the Solution Mapping for Nonlinear Semidefinite Programming
by: Chen, Liang, et al.
Published: (2024)