Cover Image

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kabgani, Alireza, Ahookhosh, Masoud
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control 90C26, 65K05, 49J52, 90C30, 49M27
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)

Moreau envelope and proximal-point methods under the lens of high-order regularization
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)

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

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)

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)

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

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

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)

Flexible block-iterative analysis for the Frank-Wolfe algorithm
by: Braun, Gábor, et al.
Published: (2024)

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

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

On the directional asymptotic approach in optimization theory
by: Benko, Matúš, 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)

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

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

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

On second-order Karush--Kuhn--Tucker optimality conditions for $C^{1,1}$ vector optimization problems
by: Van Tuyen, Nguyen
Published: (2025)

Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model
by: Tao, Ting, et al.
Published: (2024)

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

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

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

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

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

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)

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)

Convergence of ZH-type nonmonotone descent method for Kurdyka-Łojasiewicz optimization problems
by: Qian, Yitian, et al.
Published: (2024)

Second-Order Optimality Conditions for Sparse Differentiable Optimization Problems via Limiting Second-Order Subdifferentials
by: Huyen, Luu Thi Thu, et al.
Published: (2026)

A full splitting algorithm for fractional programs with structured numerators and denominators
by: Boţ, Radu Ioan, et al.
Published: (2023)

A Single-loop Proximal Subgradient Algorithm for A Class Structured Fractional Programs
by: Han, Deren, et al.
Published: (2025)

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

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

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

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
by: Thieu, Nguyen Nang, et al.
Published: (2026)

The iterates of FISTA convergence even under inexact computations and stochastic gradients
by: Salzo, Saverio
Published: (2025)

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