Copertina

Riemannian Trust Region Methods for SC$^1$ Minimization

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Zhang, Chenyu, Xiao, Rufeng, Huang, Wen, Jiang, Rujun
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Optimization and Control 90C30, 49J52, 65K05, 90C26
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

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

Inexact Limited Memory Bundle Method
di: Lampainen, Jenni, et al.
Pubblicazione: (2026)

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

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

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

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

A new problem qualification based on approximate KKT conditions for Lipschitzian optimization with application to bilevel programming
di: Käming, Isabella, et al.
Pubblicazione: (2024)

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

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

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

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

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

Inexact Riemannian Gradient Descent Method for Nonconvex Optimization
di: Zhou, Juan, et al.
Pubblicazione: (2024)

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

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

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

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
di: Xie, Xiyuan, et al.
Pubblicazione: (2025)

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

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

Proximal methods for structured nonsmooth optimization over Riemannian submanifolds
di: Li, Qia, et al.
Pubblicazione: (2024)

Weak sharp minima at infinity and solution stability in mathematical programming via asymptotic analysis
di: Lara, Felipe, et al.
Pubblicazione: (2024)

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

Non-Convex Self-Concordant Functions: Practical Algorithms and Complexity Analysis
di: Goldfarb, Donald, et al.
Pubblicazione: (2025)

Alternating Gradient-Type Algorithm for Bilevel Optimization with Inexact Lower-Level Solutions via Moreau Envelope-based Reformulation
di: Bai, Xiaoning, et al.
Pubblicazione: (2024)

A General Recipe for Parameter-Free Nonconvex Optimization via Higher-Order Regularization
di: Marumo, Naoki, et al.
Pubblicazione: (2026)

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

Revisiting the Geometrically Decaying Step Size: Linear Convergence for Smooth or Non-Smooth Functions
di: Kim, Jihun
Pubblicazione: (2025)

On the existence and the stability of solutions in nonconvex vector optimization
di: Van Nghi, Tran, et al.
Pubblicazione: (2025)

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

RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs
di: Niu, Yi-Shuai
Pubblicazione: (2026)

Trust-Region Method for Optimization of Set-Valued Maps Given by Finitely Many Functions
di: Ghosh, Suprova, et al.
Pubblicazione: (2025)

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

Asymptotic Convergence and Stability of Adaptive Gradient Methods in Smooth Non-convex Optimization
di: Jin, Ruinan, et al.
Pubblicazione: (2026)

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

Parameter-Free Accelerated Quasi-Newton Method for Nonconvex Optimization
di: Marumo, Naoki
Pubblicazione: (2025)

Oracle complexities of augmented Lagrangian methods for nonsmooth manifold optimization
di: Deng, Kangkang, et al.
Pubblicazione: (2024)

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