Imagen de Portada

On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gfrerer, H.
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C26, 65K05, 90C06
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
por: Zeng, Hanfeng, et al.
Publicado: (2026)

On the role of semismoothness in nonsmooth numerical analysis: Theory
por: Gfrerer, H., et al.
Publicado: (2024)

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

On the role of semismoothness in the implicit programming approach to selected nonsmooth optimization problems
por: Gfrerer, Helmut, et al.
Publicado: (2024)

A globalization of L-BFGS and the Barzilai-Borwein method for nonconvex unconstrained optimization
por: Mannel, Florian
Publicado: (2024)

Stochastic momentum ADMM for nonconvex and nonsmooth optimization with application to PnP algorithm
por: Deng, Kangkang, et al.
Publicado: (2025)

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

Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
por: Marumo, Naoki, et al.
Publicado: (2023)

Randomized block proximal method with locally Lipschitz continuous gradient
por: Pérez-Aros, Pedro, et al.
Publicado: (2025)

Stability and convergence analysis of AdaGrad for non-convex optimization via novel stopping time-based techniques
por: Jin, Ruinan, et al.
Publicado: (2024)

Technical results on the convergence of quasi-Newton methods for nonsmooth optimization
por: Gebken, Bennet
Publicado: (2025)

On the convergence of proximal gradient methods for convex simple bilevel optimization
por: Latafat, Puya, et al.
Publicado: (2023)

Steering exact penalty DCA for nonsmooth DC optimization problems with equality and inequality constraints
por: Dolgopolik, M. V.
Publicado: (2021)

Affordable mixed-integer Lagrangian methods: optimality conditions and convergence analysis
por: De Marchi, Alberto
Publicado: (2024)

A min-max reformulation and proximal algorithms for a class of structured nonsmooth fractional optimization problems
por: Zhou, Junpeng, et al.
Publicado: (2025)

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

Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees
por: Lu, Zhaosong, et al.
Publicado: (2024)

Proximal Limited-Memory Quasi-Newton Methods for Nonsmooth Nonconvex Optimization
por: Dahl, Simeon vom, et al.
Publicado: (2026)

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

Fast Frank--Wolfe Algorithms with Adaptive Bregman Step-Size for Weakly Convex Functions
por: Takahashi, Shota, et al.
Publicado: (2025)

An efficient asymptotic DC method for sparse and low-rank matrix recovery
por: Ding, Mingcai, et al.
Publicado: (2024)

A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
por: Pham, Tan Nhat, et al.
Publicado: (2022)

A Stochastic Gradient Descent Method for Globally Minimizing Nearly Convex Functions
por: Bao, Chenglong, et al.
Publicado: (2025)

Hybrid optimal control with mixed-integer Lagrangian methods
por: Nikitina, Viktoriya, et al.
Publicado: (2024)

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

A structured L-BFGS method and its application to inverse problems
por: Mannel, Florian, et al.
Publicado: (2023)

A structured L-BFGS method with diagonal scaling and its application to image registration
por: Mannel, Florian, et al.
Publicado: (2024)

Heavy-ball Differential Equation Achieves $O(\varepsilon^{-7/4})$ Convergence for Nonconvex Functions
por: Okamura, Kaito, et al.
Publicado: (2024)

Parameter-free accelerated gradient descent for nonconvex minimization
por: Marumo, Naoki, et al.
Publicado: (2022)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
por: Lu, Zhaosong, et al.
Publicado: (2025)

A Semismooth Newton Stochastic Proximal Point Algorithm with Variance Reduction
por: Milzarek, Andre, et al.
Publicado: (2022)

Safeguarding adaptive methods: global convergence of Barzilai-Borwein and other stepsize choices
por: Ou, Hongjia, et al.
Publicado: (2024)

Inexact Limited Memory Bundle Method
por: Lampainen, Jenni, et al.
Publicado: (2026)

Monomial barrier functions for the box-constrained convex optimization problems
por: Fayed, Hatem
Publicado: (2024)

CLARSTA: A random subspace trust-region algorithm for convex-constrained derivative-free optimization
por: Chen, Yiwen, et al.
Publicado: (2025)

Solving nonconvex optimization problems via a second order dynamical system with unbounded damping
por: László, Szilárd Csaba
Publicado: (2025)

Mixed-integer linearity in nonlinear optimization: a trust region approach
por: De Marchi, Alberto
Publicado: (2023)

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

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

A stochastic use of the Kurdyka-Lojasiewicz property: Investigation of optimization algorithms behaviours in a non-convex differentiable framework
por: Fest, Jean-Baptiste, et al.
Publicado: (2023)