Cover Image

Robust Learning Meets Quasar-Convex Optimization: Inexact High-Order Proximal-Point Methods

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kabgani, Alireza, Lara, Felipe, Ahookhosh, Masoud
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

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

Asymptotic Convergence Analysis of High-Order Proximal-Point Methods Beyond Sublinear Rates
by: Ahookhosh, Masoud, et al.
Published: (2025)

Speeding Up Nonsmooth Bayesian MCMC Sampling via Inexact Proximal Unadjusted Langevin Algorithm
by: Ghaderi, Susan, et al.
Published: (2026)

On fundamental properties of high-order forward-backward envelope
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)

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

Minimizing smooth Kurdyka-Łojasiewicz functions via generalized descent methods: Convergence rate and complexity
by: Ahookhosh, Masoud, et al.
Published: (2025)

First-order majorization-minimization meets high-order majorant: Boosted inexact high-order forward-backward method
by: Kabgani, Alireza, 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)

Distributed and Inexact Proximal Gradient Method for Online Convex Optimization
by: Bastianello, Nicola, et al.
Published: (2020)

Inexact and Implementable Accelerated Newton Proximal Extragradient Method for Convex Optimization
by: Huang, Ziyu, et al.
Published: (2024)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
by: de Brito, José, et al.
Published: (2025)

An Inexact Proximal Framework for Nonsmooth Riemannian Difference-of-Convex Optimization
by: Jiang, Bo, et al.
Published: (2025)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

An Inexact Preconditioned Zeroth-order Proximal Method for Composite Optimization
by: Liu, Shanglin, et al.
Published: (2024)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Inexact Levenberg-Marquardt methods under Hölder metric subregularity
by: Symoens, Bas, et al.
Published: (2025)

OFF (Proximal) Newton-type Methods with Inexact Derivatives for Unconstrained Optimization
by: Zhu, Hong
Published: (2025)

Inexact Accelerated Proximal Gradient Method Revisit: An Economical Variant via Shadow Points
by: Yang, Lei, et al.
Published: (2025)

Second-order methods for provably escaping strict saddle points in composite nonconvex and nonsmooth optimization
by: Bodard, Alexander, et al.
Published: (2025)

A New Inexact Gradient Descent Method with Applications to Nonsmooth Convex Optimization
by: Khanh, Pham Duy, et al.
Published: (2023)

An Inexact Bregman Proximal Difference-of-Convex Algorithm with Two Types of Relative Stopping Criteria
by: Yang, Lei, et al.
Published: (2024)

Improved Analysis of Restarted Accelerated Gradient and Augmented Lagrangian Methods via Inexact Proximal Point Frameworks
by: Burns, Matthew X., et al.
Published: (2026)

A Relative Inexact Proximal Gradient Method with an Explicit Linesearch
by: Bello-Cruz, Yunier, et al.
Published: (2024)

An Inexact Weighted Proximal Trust-Region Method
by: Maia, Leandro Farias, et al.
Published: (2026)

Convergence Analysis of a Relative-type Inexact Preconditioned Proximal ALM for Convex Nonlinear Programming
by: Yang, Lei, et al.
Published: (2025)

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

Inexact Proximal Point and Tseng Algorithms with Nonsummable Errors to Solve Monotone Inclusions
by: Le, Ba Khiet, et al.
Published: (2026)

A Proximal Descent Method for Minimizing Weakly Convex Optimization
by: Liao, Feng-Yi, et al.
Published: (2025)

A Proximal Method for Composite Optimization with Smooth and Convex Components
by: Uzun, Samet, et al.
Published: (2025)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
by: de Brito, Jose, et al.
Published: (2026)

Hinge-Proximal Stochastic Gradient Methods for Convex Optimization with Functional Constraints
by: Rajoriya, Vaibhav, et al.
Published: (2025)

Approximating Multiple Robust Optimization Solutions in One Pass via Proximal Point Methods
by: Hao, Hao, et al.
Published: (2024)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)

Smooth Quasar-Convex Optimization with Constraints
by: Martínez-Rubio, David
Published: (2025)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
by: Moon, Sang Bin, et al.
Published: (2024)

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
by: Dizon, Neil D., et al.
Published: (2026)

An Inexact General Descent Method with Applications in Differential Equation-Constrained Optimization
by: Macedo, Humberto Gimenes, et al.
Published: (2025)

An Inexact Variable Metric Proximal Gradient-subgradient Algorithm for a Class of Fractional Optimization Problems
by: Yang, Lei, et al.
Published: (2025)

An Inexact Conditional Gradient Method for Constrained Bilevel Optimization
by: Abolfazli, Nazanin, et al.
Published: (2023)