Cover Image

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Ang, Andersen, De Sterck, Hans, Vavasis, Stephen
Format:	Preprint
Published:	2023
Subjects:	Optimization and Control 49J52, 49M37, 65K05, 65N55, 90C25, 90C30, 90C90
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Complexity of an inexact stochastic SQP algorithm for equality constrained optimization
by: O'Neill, Michael J., et al.
Published: (2026)

An interior-point trust-region method for nonsmooth regularized bound-constrained optimization
by: Leconte, Geoffroy, et al.
Published: (2024)

Augmented Lagrangian methods for fully convex composite optimization
by: De Marchi, Alberto, et al.
Published: (2025)

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

An interior proximal gradient method for nonconvex optimization
by: De Marchi, Alberto, et al.
Published: (2022)

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

Moreau envelope and proximal-point methods under the lens of high-order regularization
by: Kabgani, Alireza, et al.
Published: (2025)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
by: Ou, Hongjia, et al.
Published: (2025)

A truncated epsilon-subdifferential method for global DC optimization
by: Bagirov, Adil M., et al.
Published: (2025)

A relaxed version of Ryu's three-operator splitting method for structured nonconvex optimization
by: Alcantara, Jan Harold, et al.
Published: (2025)

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

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

Implementing a unified solver for nonlinearly constrained optimization
by: Vanaret, Charlie, et al.
Published: (2024)

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
by: Jin, Ruinan, et al.
Published: (2026)

Understanding the Douglas-Rachford splitting method through the lenses of Moreau-type envelopes
by: Atenas, Felipe
Published: (2023)

Shadow splitting methods for nonconvex optimisation: epi-approximation, convergence and saddle point avoidance
by: Atenas, Felipe
Published: (2025)

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
by: Käming, Isabella, et al.
Published: (2024)

One-parameter Filled Function Method for Non-convex Multi-objective Optimization Problems
by: Adhikary, Bikram, et al.
Published: (2026)

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

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

Local properties and augmented Lagrangians in fully nonconvex composite optimization
by: De Marchi, Alberto, et al.
Published: (2023)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, et al.
Published: (2025)

Retrospective Approximation Sequential Quadratic Programming for Stochastic Optimization with General Deterministic Nonlinear Constraints
by: Berahas, Albert S., et al.
Published: (2025)

On the Convergence and Complexity of Proximal Gradient and Accelerated Proximal Gradient Methods under Adaptive Gradient Estimation
by: Bollapragada, Raghu, et al.
Published: (2025)

Complexity of trust-region methods with unbounded Hessian approximations for smooth and nonsmooth optimization
by: Leconte, Geoffroy, et al.
Published: (2023)

An Inexact Regularized Proximal Newton Method without Line Search
by: Dahl, Simeon vom, et al.
Published: (2024)

Subgradient Regularization: A Descent-Oriented Subgradient Method for Nonsmooth Optimization
by: Li, Hanyang, et al.
Published: (2025)

Riemannian Trust Region Methods for SC$^1$ Minimization
by: Zhang, Chenyu, et al.
Published: (2023)

Inexact Limited Memory Bundle Method
by: Lampainen, Jenni, et al.
Published: (2026)

A fresh look into variational analysis of $\mathcal C^2$-partly smooth functions
by: Hang, Nguyen T. V., et al.
Published: (2024)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
by: Ghosh, Suprova, et al.
Published: (2025)

A Proximal Stochastic Gradient Method with Adaptive Step Size and Variance Reduction for Convex Composite Optimization
by: Fang, Changjie, et al.
Published: (2025)

On the Convergence of Interior-Point Methods for Bound-Constrained Nonlinear Optimization Problems with Noise
by: Dezfulian, Shima, et al.
Published: (2024)

Local Convergence Results for Sequential Quadratic Programming with Complementarity Constraints
by: Nurkanović, Armin
Published: (2026)

A Globally Convergent Method for Computing B-stationary Points of Mathematical Programs with Equilibrium Constraints
by: Nurkanović, Armin, et al.
Published: (2025)

First- and Second-Order Stochastic Adaptive Regularization with Cubics: High Probability Iteration and Sample Complexity
by: Scheinberg, Katya, et al.
Published: (2023)

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

Using second-order information in gradient sampling methods for nonsmooth optimization
by: Gebken, Bennet
Published: (2022)

Mathematical programs with complementarity constraints and application to hyperparameter tuning for nonlinear support vector machines
by: Ward, Samuel, et al.
Published: (2025)

MPPI-IPDDP: Hybrid Method of Collision-Free Smooth Trajectory Generation for Autonomous Robots
by: Kim, Min-Gyeom, et al.
Published: (2022)