Cover Image

LeAP-SSN: A Semismooth Newton Method with Global Convergence Rates

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Alphonse, Amal, Dvurechensky, Pavel, Papadopoulos, Ioannis P. A., Sirotenko, Clemens
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Skip the Hessian, Keep the Rates: Globalized Semismooth Newton with Lazy Hessian Updates
by: Alphonse, Amal, et al.
Published: (2026)

A Globalized Semismooth Newton Method for Prox-regular Optimization Problems
by: Wu, Yuqia, et al.
Published: (2025)

A neural network approach to learning solutions of a class of elliptic variational inequalities
by: Alphonse, Amal, et al.
Published: (2024)

Semismooth Newton Methods for Risk-Averse Markov Decision Processes
by: Gargiani, Matilde, et al.
Published: (2025)

Sparse Quadratically Constrained Quadratic Programming via Semismooth Newton Method
by: Li, Shuai, et al.
Published: (2025)

A Globalized Inexact Semismooth Newton Method for Nonsmooth Fixed-point Equations involving Variational Inequalities
by: Alphonse, Amal, et al.
Published: (2024)

A Specialized Semismooth Newton Method for Kernel-Based Optimal Transport
by: Lin, Tianyi, et al.
Published: (2023)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

Multilevel Regularized Newton Methods with Fast Convergence Rates
by: Tsipinakis, Nick, et al.
Published: (2024)

Two Typical Implementable Semismooth* Newton Methods for Generalized Equations are G-Semismooth Newton Methods
by: Chen, Liang, et al.
Published: (2024)

Incremental Gauss--Newton Methods with Superlinear Convergence Rates
by: Zhou, Zhiling, et al.
Published: (2024)

Semismooth Newton Method for Boundary Bilinear Control
by: Casas, Eduardo, et al.
Published: (2024)

Semismooth Newton Augmented Lagrangian Algorithm for Adaptive Lasso Penalized Least Squares in Semiparametric Regression
by: Li, Peili, et al.
Published: (2021)

Incremental Quasi-Newton Methods with Faster Superlinear Convergence Rates
by: Liu, Zhuanghua, et al.
Published: (2024)

Subdifferentials and penalty approximations of the obstacle problem
by: Alphonse, Amal, et al.
Published: (2024)

Newton Method Revisited: Global Convergence Rates up to $\mathcal {O}\left(k^{-3} \right)$ for Stepsize Schedules and Linesearch Procedures
by: Hanzely, Slavomír, et al.
Published: (2024)

Simple Stepsize for Quasi-Newton Methods with Global Convergence Guarantees
by: Agafonov, Artem, et al.
Published: (2025)

Convergence Rate Bounds for the Mirror Descent Method: IQCs, Popov Criterion and Bregman Divergence
by: Li, Mengmou, et al.
Published: (2023)

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

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

A Regularized Hessian-Free Inexact Newton-Type Method with Global $\mathcal{O}(k^{-2})$ Convergence
by: Maia, Leandro Farias, et al.
Published: (2026)

Online Learning Guided Quasi-Newton Methods with Global Non-Asymptotic Convergence
by: Jiang, Ruichen, et al.
Published: (2024)

Data-driven methods for quantitative imaging
by: Dong, Guozhi, et al.
Published: (2024)

Optimal design with uncertainties: a risk-averse approach
by: Alphonse, Amal, et al.
Published: (2026)

Exploiting higher-order derivatives in convex optimization methods
by: Kamzolov, Dmitry, et al.
Published: (2022)

Krylov Cubic Regularized Newton: A Subspace Second-Order Method with Dimension-Free Convergence Rate
by: Jiang, Ruichen, et al.
Published: (2024)

Revisiting Superlinear Convergence of Proximal Newton-Like Methods to Degenerate Solutions
by: Lee, Ching-pei, et al.
Published: (2026)

Gradient Regularized Newton Boosting Trees with Global Convergence
by: Zozoulenko, Nikita, et al.
Published: (2026)

A Cournot-Nash Model for a Coupled Hydrogen and Electricity Market
by: Dvurechensky, Pavel, et al.
Published: (2024)

A Riemannian Proximal Newton Method
by: Si, Wutao, et al.
Published: (2023)

High-Probability Convergence for Composite and Distributed Stochastic Minimization and Variational Inequalities with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2023)

First-Order Projected Algorithms With the Same Linear Convergence Rate Bounds as Their Unconstrained Counterparts
by: Li, Mengmou, et al.
Published: (2025)

Improved Stochastic Optimization of LogSumExp
by: Gladin, Egor, et al.
Published: (2025)

Randomized gradient-free methods in convex optimization
by: Gasnikov, Alexander, et al.
Published: (2022)

On Solving Minimization and Min-Max Problems by First-Order Methods with Relative Error in Gradients
by: Vasin, Artem, et al.
Published: (2025)

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

Explicit Global Convergence Rates of BFGS without Line Search
by: Yu, Jianjiang, et al.
Published: (2025)

Sketch-and-Project Meets Newton Method: Global $\mathcal O(k^{-2})$ Convergence with Low-Rank Updates
by: Hanzely, Slavomír
Published: (2023)

High Probability Complexity Bounds for Non-Smooth Stochastic Optimization with Heavy-Tailed Noise
by: Gorbunov, Eduard, et al.
Published: (2021)

Convergence Rate Analysis for Monotone Accelerated Proximal Gradient Method
by: Wang, Zepeng, et al.
Published: (2025)