Cover Image

A Simple First-Order Algorithm for Full-Rank Equality Constrained Optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Gratton, Serge, Toint, Philippe L.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 49M37, 65K05, 65Y20 F.2.1; G.1.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

An objective-function-free algorithm for nonconvex stochastic optimization with deterministic equality and inequality constraints
by: Gratton, S., et al.
Published: (2026)

An objective-function-free algorithm for general smooth constrained optimization
by: Bellavia, S., et al.
Published: (2026)

Iteration complexity of the Difference-of-Convex Algorithm for unconstrained optimization: a simple proof
by: Gratton, Serge, et al.
Published: (2026)

S2MPJ and CUTEst optimization problems for Matlab, Python and Julia
by: Gratton, Serge, et al.
Published: (2024)

Fast Stochastic Second-Order Adagrad for Nonconvex Bound-Constrained Optimization
by: Bellavia, S., et al.
Published: (2025)

A Stochastic Objective-Function-Free Adaptive Regularization Method with Optimal Complexity
by: Gratton, Serge, et al.
Published: (2024)

Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $o(ε^{-2})$ rather than $\mathcal{O}(ε^{-2})$
by: Gratton, Serge, et al.
Published: (2024)

Recursive Bound-Constrained AdaGrad with Applications to Multilevel and Domain Decomposition Minimization
by: Gratton, Serge, et al.
Published: (2025)

Examples of slow convergence for adaptive regularization optimization methods are not isolated
by: Toint, Philippe L.
Published: (2024)

prunAdag: an adaptive pruning-aware gradient method
by: Porcelli, Margherita, et al.
Published: (2025)

Stochastic Multiresolution Image Sketching for Inverse Imaging Problems
by: Perelli, Alessandro, et al.
Published: (2024)

An optimally fast objective-function-free minimization algorithm using random subspaces
by: Bellavia, S., et al.
Published: (2023)

A Proximal-Gradient Method for Constrained Optimization
by: Dai, Yutong, et al.
Published: (2024)

Data-Dependent Complexity of First-Order Methods for Binary Classification
by: Hough, Matthew, et al.
Published: (2025)

On the Convergence Rates of Iterative Regularization Algorithms for Composite Bi-Level Optimization
by: Shtern, Shimrit, et al.
Published: (2025)

An inexact infeasible arc-search interior-point method for linear optimization problems
by: Iida, Einosuke, et al.
Published: (2024)

Optimal Design of Resolvent Splitting Algorithms
by: Bassett, Robert L, et al.
Published: (2024)

A Primal-Dual Frank-Wolfe Algorithm for Linear Programming
by: Hough, Matthew, et al.
Published: (2024)

Complexity of Adagrad and other first-order methods for nonconvex optimization problems with bounds constraints
by: Gratton, Serge, et al.
Published: (2024)

Exploiting Parallelism in a QPALM-based Solver for Optimal Control
by: Pas, Pieter, et al.
Published: (2026)

Cyqlone: A Parallel, High-Performance Linear Solver for Optimal Control
by: Pas, Pieter, et al.
Published: (2025)

Coupled Adaptable Backward-Forward-Backward Resolvent Splitting Algorithm (CABRA): A Matrix-Parametrized Resolvent Splitting Method for the Sum of Maximal Monotone and Cocoercive Operators Composed with Linear Coupling Operators
by: Barkley, Peter, et al.
Published: (2025)

Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer
by: Dereich, Steffen, et al.
Published: (2025)

A Two Stepsize SQP Method for Nonlinear Equality Constrained Stochastic Optimization
by: O'Neill, Michael J.
Published: (2024)

A Proximal-Gradient Method for Solving Regularized Optimization Problems with General Constraints
by: Curtis, Frank E., et al.
Published: (2025)

OpenSQP: A Reconfigurable Open-Source SQP Algorithm in Python for Nonlinear Optimization
by: Joshy, Anugrah Jo, et al.
Published: (2025)

Gradient Descent Methods for Regularized Optimization
by: Nikolovski, Filip, et al.
Published: (2024)

An infeasible interior-point arc-search method with Nesterov's restarting strategy for linear programming problems
by: Iida, Einosuke, et al.
Published: (2023)

Optimization Strategies for Variational Quantum Algorithms in Noisy Landscapes
by: Novák, Vojtěch, et al.
Published: (2025)

Handbook of Convergence Theorems for (Stochastic) Gradient Methods
by: Garrigos, Guillaume, et al.
Published: (2023)

Efficient Implementation of Third-Order Tensor Methods with Adaptive Regularization for Unconstrained Optimization
by: Cartis, Coralia, et al.
Published: (2024)

Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method
by: Dereich, Steffen, et al.
Published: (2026)

A Second-Order Algorithm Based on Affine Scaling Interior-Point Methods for nonlinear Optimisation with bound constraints
by: Pei, Yonggang, et al.
Published: (2026)

Data-Adaptive Low-Rank Sparse Subspace Clustering
by: Kopriva, Ivica
Published: (2025)

Approximate Bregman Proximal Gradient Algorithm for Relatively Smooth Nonconvex Optimization
by: Takahashi, Shota, et al.
Published: (2023)

Symbolic Algorithm for Solving SLAEs with Multi-Diagonal Coefficient Matrices
by: Veneva, Milena
Published: (2024)

Moduli space of optimization algorithms
by: Pasechnyuk-Vilensky, Dmitry, et al.
Published: (2025)

Escaping Saddle Points via Curvature-Calibrated Perturbations: A Complete Analysis with Explicit Constants and Empirical Validation
by: Alpay, Faruk, et al.
Published: (2025)

Majorization-Minimization-Based Levenberg--Marquardt Method for Constrained Nonlinear Least Squares
by: Marumo, Naoki, et al.
Published: (2020)

Stochastic convergence of parallel asynchronous adaptive first-order methods
by: Gratton, Serge, et al.
Published: (2026)