Cover Image

Complexity of quadratic penalty methods with adaptive accuracy under a PL condition for the constraints

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Goyens, Florentin, Grapiglia, Geovani N.
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
by: Pinheiro, Maria Eduarda, et al.
Published: (2024)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
by: Birgin, Ernesto G., et al.
Published: (2025)

Computing second-order points under equality constraints: revisiting Fletcher's augmented Lagrangian
by: Goyens, Florentin, et al.
Published: (2022)

On the Complexity of Lower-Order Implementations of Higher-Order Methods
by: Doikov, Nikita, et al.
Published: (2025)

TRFD: A derivative-free trust-region method based on finite differences for composite nonsmooth optimization
by: Davar, Dânâ, et al.
Published: (2024)

Sub-sampled Trust-Region Methods with Deterministic Worst-Case Complexity Guarantees
by: Goncalves, Max L. N., et al.
Published: (2025)

Riemannian trust-region methods for strict saddle functions with complexity guarantees
by: Goyens, Florentin, et al.
Published: (2024)

Complexity guarantees and polling strategies for Riemannian direct-search methods
by: Cavarretta, Bastien, et al.
Published: (2025)

Enhancing finite-difference based derivative-free optimization methods with machine learning
by: Taminiau, Timothé, et al.
Published: (2025)

A Finite-Difference Trust-Region Method for Convexly Constrained Smooth Optimization
by: Davar, Dânâ, et al.
Published: (2025)

A Non-Monotone Line-Search Method for Minimizing Functions with Spurious Local Minima
by: Aminifard, Zohreh, et al.
Published: (2025)

Geometric design of the tangent term in landing algorithms for orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2025)

Fully Adaptive Zeroth-Order Method for Minimizing Functions with Compressible Gradients
by: Grapiglia, Geovani Nunes, et al.
Published: (2025)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2024)

The sketched landing method for large-scale optimization under orthogonality constraints
by: Goyens, Florentin, et al.
Published: (2026)

Riemannian optimization with finite-difference gradient approximations
by: Taminiau, Timothé, et al.
Published: (2026)

A Riemannian AdaGrad-Norm Method
by: Bento, Glaydston de C., et al.
Published: (2025)

Registration of algebraic varieties using Riemannian optimization
by: Goyens, Florentin, et al.
Published: (2024)

Error bounds, PL condition, and quadratic growth for weakly convex functions, and linear convergences of proximal point methods
by: Liao, Feng-Yi, et al.
Published: (2023)

The Riemannian Landing Method: From projected gradient flows to SQP
by: Goyens, Florentin, et al.
Published: (2026)

Error bound and exact penalty method for optimization problems with nonnegative orthogonal constraint
by: Qian, Yitian, et al.
Published: (2021)

A single-loop proximal-conditional-gradient penalty method
by: Zhang, Hao, et al.
Published: (2024)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2025)

Q-quadratic convergence of the centralized circumcentered-reflection method under a relative interior condition
by: Bello-Cruz, Yunier
Published: (2026)

Rank-one convexification for quadratic optimization problems with step function penalties
by: Choi, Soobin, et al.
Published: (2025)

Global optimization of quadratic root-difference minimization under elliptic annulus constraints
by: Yang, Meijia, et al.
Published: (2026)

Output-feedback model predictive control under dynamic uncertainties using integral quadratic constraints
by: Schwenkel, Lukas, et al.
Published: (2025)

Tikhonov regularized exterior penalty methods for hierarchical variational inequalities
by: Marschner, Meggie, et al.
Published: (2025)

Extended mean-field control under constraints: The generalized Fritz-John conditions and Lagrangian method
by: Bo, Lijun, et al.
Published: (2024)

A condensing approach for linear-quadratic optimization with geometric constraints
by: De Marchi, Alberto
Published: (2025)

An adaptive proximal safeguarded augmented Lagrangian method for nonsmooth DC problems with convex constraints
by: Kanzow, Christian, et al.
Published: (2025)

A unified framework for inexact adaptive stepsizes in the gradient methods, the conjugate gradient methods and the quasi-Newton methods for strictly convex quadratic optimization
by: Liu, Zexian
Published: (2026)

A universal convergence theorem for primal-dual penalty and augmented Lagrangian methods
by: Dolgopolik, M. V.
Published: (2024)

Reinforcement learning for adaptive interior point methods in convex quadratic programming
by: Bertoncini, Jeremy, et al.
Published: (2025)

Robust and structure exploiting optimization algorithms: An integral quadratic constraint approach
by: Michalowsky, Simon, et al.
Published: (2019)

A penalty-interior point method combined with MADS for equality and inequality constrained optimization
by: Audet, Charles, et al.
Published: (2026)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
by: Bourkhissi, Lahcen El, et al.
Published: (2023)

Complexity and numerical experiments of a new adaptive generic proximal bundle method
by: Guigues, Vincent, et al.
Published: (2024)

On the strength of Burer's lifted convex relaxation to quadratic programming with ball constraints
by: Kılınç-Karzan, Fatma, et al.
Published: (2024)

Adaptive Algorithms for Nonconvex Bilevel Optimization under PŁ Conditions
by: Shi, Xu, et al.
Published: (2025)