Cover Image

Identifiability, the KL property in metric spaces, and subgradient curves

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Lewis, Adrian, Tian, Tonghua
Format:	Preprint
Published:	2022
Subjects:	Optimization and Control Numerical Analysis 49J52, 49Q12, 90C56, 65K10, 37C10
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Optimal Diagonal Preconditioning Beyond Worst-Case Conditioning: Theory and Practice of Omega Scaling
by: Ghadimi, Saeed, 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)

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

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

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

Tilt stability of Ky-Fan $κ$-norm composite optimization
by: Liu, Yulan, 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)

Lipschitz minimization and the Goldstein modulus
by: Kong, Siyu, 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)

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

The $ω$-Condition Number: Applications to Optimal Preconditioning and Low Rank Generalized Jacobian Updating
by: Jung, Woosuk L., et al.
Published: (2023)

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

Convergence analysis of a proximal-type algorithm for DC programs with applications to variable selection
by: Wu, Shuang, et al.
Published: (2015)

A double iteratively reweighted algorithm for solving group sparse nonconvex optimization models
by: Nie, Wanqin, et al.
Published: (2025)

Calibration for minimal surfaces with free boundary and Cheeger-type problems
by: Bouchitté, Guy, et al.
Published: (2025)

A Trust Region Proximal Gradient Method for Nonlinear Multi-objective Optimization Problems
by: Ansary, Md Abu Talhamainuddin
Published: (2024)

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

Stochastic Inertial Dynamics Via Time Scaling and Averaging
by: Maulen-Soto, Rodrigo, et al.
Published: (2024)

Stability of Nonhomogeneous Split Equality and Split Feasibility Problems with Possibly Nonconvex Constraint Sets
by: Huong, Vu Thi, et al.
Published: (2024)

Stability analysis of split equality and split feasibility problems
by: Huong, Vu Thi, et al.
Published: (2024)

A $\operatorname{prox}$-Based Semi-Smooth Newton Method for TV-Minimization
by: Bartels, Sören, et al.
Published: (2026)

Penalty Interior-Point Method Fails to Converge
by: Leyffer, Sven
Published: (2003)

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

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

Composite Optimization with Indicator Functions: Stationary Duality and a Semismooth Newton Method
by: Zhang, Penghe, et al.
Published: (2025)

Randomized Submanifold Subgradient Method for Optimization over Stiefel Manifolds
by: Cheung, Andy Yat-Ming, et al.
Published: (2024)

Curves of Minimax Curvature
by: Kaya, C. Yalçın, et al.
Published: (2024)

Riemannian Bilevel Optimization with Gradient Aggregation
by: Chen, Zhuo, et al.
Published: (2025)

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

A smoothed proximal trust-region algorithm for nonconvex optimization problems with $L^p$-regularization, $p\in (0,1)$
by: Antil, Harbir, et al.
Published: (2025)

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

The Intrinsic Riemannian Proximal Gradient Method for Nonconvex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

The Intrinsic Riemannian Proximal Gradient Method for Convex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

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

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

A line search filter sequential adaptive cubic regularisation algorithm for nonlinearly constrained optimization
by: Pei, Yonggang, et al.
Published: (2024)