Cover Image

Nonsmooth Convex Optimization using the Specular Gradient Method with Root-Linear Convergence

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Jung, Kiyuob, Oh, Jehan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Numerical Analysis 90C25, 49J52, 65K05, 26A27
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 Linear Convergence of ADMM for Isotropic TV Norm Compressed Sensing
by: Torres, Emmanuel Gil, 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)

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

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

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

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

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

Convergence of the Preconditioned Proximal Point Method and Douglas-Rachford Splitting in the Absence of Monotonicity
by: Evens, Brecht, et al.
Published: (2023)

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

The Golden Ratio Proximal ADMM with Norm Independent Step-Sizes for Separable Convex Optimization
by: Soe, Santanu, et al.
Published: (2025)

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

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

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)

Algorithmic approaches to avoiding bad local minima in nonconvex inconsistent feasibility
by: Dinh, Thi Lan, et al.
Published: (2025)

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

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

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

A Projected Variable Smoothing for Weakly Convex Optimization and Supremum Functions
by: López-Rivera, Sergio, et al.
Published: (2025)

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

Specular differentiation in normed vector spaces: Quasi-Mean Value and Quasi-Fermat Theorems
by: Jung, Kiyuob
Published: (2026)

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

Parallel Polyhedral Projection Method for the Convex Feasibility Problem
by: Barros, Pablo, et al.
Published: (2025)

Bregman Proximal Linearized ADMM for Minimizing Separable Sums Coupled by a Difference of Functions
by: Pham, Tan Nhat, et al.
Published: (2024)

Extra-Gradient Method with Flexible Anchoring: Strong Convergence and Fast Residual Decay
by: Boţ, Radu Ioan, et al.
Published: (2024)

GLL-type Nonmonotone Descent Methods Revisited under Kurdyka-Łojasiewicz Property
by: Qian, Yitian, et al.
Published: (2025)

A Conjugate Gradient Method for Nonlinear Programming Problems using Caputo Fractional Gradients
by: Shawa, Barsha, et al.
Published: (2025)

An Inexact Boosted Difference of Convex Algorithm for Nondifferentiable Functions
by: Ferreira, Orizon P., et al.
Published: (2024)

Nonlinear numerical schemes using specular differentiation for initial value problems of first-order ordinary differential equations
by: Jung, Kiyuob
Published: (2026)

Nonsmooth Set-Gradient Ascent to the Pareto Front via Layered Hypervolume and Magnitude Indicators
by: Emmerich, Michael T. M.
Published: (2026)

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

On Characterizations of $σ$-Quasiconvexity
by: Bao, Nguyen Xuan Duy, et al.
Published: (2025)

Adaptive Multilevel Newton: A Quadratically Convergent Optimization Method
by: Tsipinakis, Nick, et al.
Published: (2025)

A finitely convergent circumcenter method for the Convex Feasibility Problem
by: Behling, Roger, et al.
Published: (2023)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

A proximal splitting algorithm for generalized DC programming with applications in signal recovery
by: Pham, Tan Nhat, et al.
Published: (2024)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
by: Pham, Tan Nhat, 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)

Accelerated Gradient Methods with Gradient Restart: Global Linear Convergence
by: Bao, Chenglong, et al.
Published: (2024)

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