Cover Image

Moreau envelope and proximal-point methods under the lens of high-order regularization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kabgani, Alireza, Ahookhosh, Masoud
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 49J52, 65K10, 90C26, 90C56
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

Quasar-Convex Optimization: Fundamental Properties and High-Order Proximal-Point Methods
by: Ahookhosh, Masoud, et al.
Published: (2026)

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

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

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

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

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)

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

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

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

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
by: Kim, Jihun
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)

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

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

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

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

Identifiability, the KL property in metric spaces, and subgradient curves
by: Lewis, Adrian, et al.
Published: (2022)

MGProx: A nonsmooth multigrid proximal gradient method with adaptive restriction for strongly convex optimization
by: Ang, Andersen, et al.
Published: (2023)

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

Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, et al.
Published: (2024)

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

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

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

Analyzing the speed of convergence in nonsmooth optimization via the Goldstein subdifferential with application to descent methods
by: Gebken, Bennet
Published: (2024)

Inexact Proximal Point Algorithms for Zeroth-Order Global Optimization
by: Zhang, Minxin, et al.
Published: (2024)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Ball-proximal point method on a Hadamard Manifolds
by: Babu, F., et al.
Published: (2026)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

Finding directional stationary points of DC programs
by: Thi, Hoai An Le, et al.
Published: (2026)

An inexact proximal MM method for a class of nonconvex composite image reconstruction models
by: Li, Bujin, 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)

Optimality conditions via exact penalty functions
by: Ivanov, Vsevolod Ivanov
Published: (2026)

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

Optimization Problems with Difference of Tangentially Convex Functions under Uncertainty
by: Mashkoorzadeh, Feryal, et al.
Published: (2026)