Imagen de Portada

A MINRES-based Linesearch Algorithm for Nonconvex Optimization with Non-positive Curvature Detection

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Zeng, Hanfeng, Liu, Yang, Ouyang, Wenqing, Milzarek, Andre
Formato:	Preprint
Publicado:	2026
Materias:	Optimization and Control 90C30 90C06 65K05
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)

Variational Properties of Decomposable Functions. Part I: Strict Epi-Calculus and Applications
por: Ouyang, Wenqing, et al.
Publicado: (2023)

Variational Properties of Decomposable Functions. Part II: Strong Second-Order Theory
por: Ouyang, Wenqing, et al.
Publicado: (2023)

Linesearch-free adaptive Bregman proximal gradient for convex minimization without relative smoothness
por: Ou, Hongjia, et al.
Publicado: (2025)

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

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

Line-search and Adaptive Step Sizes for Nonconvex-strongly-concave Minimax Optimization
por: Ma, Bohao, et al.
Publicado: (2026)

Local Convergence Analysis of ADMM for Nonconvex Composite Optimization
por: Xie, Xiyuan, et al.
Publicado: (2026)

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

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

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

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
por: Wang, Jia, et al.
Publicado: (2025)

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

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

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

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

A non-monotone trust-region method with noisy oracles and additional sampling
por: Krejic, Natasa, et al.
Publicado: (2023)

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

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

Proximal Gradient Descent Ascent Methods for Nonsmooth Nonconvex-Concave Minimax Problems on Riemannian Manifolds
por: Xie, Xiyuan, 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)

Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradients
por: Garg, Sachin, et al.
Publicado: (2024)

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

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

Gradient descent with adaptive stepsize converges (nearly) linearly under fourth-order growth
por: Davis, Damek, et al.
Publicado: (2024)

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

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
por: Bao, Chenglong, et al.
Publicado: (2023)

A KL-based Analysis Framework with Applications to Non-Descent Optimization Methods
por: Qiu, Junwen, et al.
Publicado: (2024)

A New Two-dimensional Model-based Subspace Method for Large-scale Unconstrained Derivative-free Optimization: 2D-MoSub
por: Xie, Pengcheng, et al.
Publicado: (2023)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
por: Wang, Haoning, et al.
Publicado: (2025)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
por: Hu, Yaling, et al.
Publicado: (2026)

Bregman Stochastic Proximal Point Algorithm with Variance Reduction
por: Traoré, Cheik, et al.
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)

Convergence Conditions for Stochastic Line Search Based Optimization of Over-parametrized Models
por: Lapucci, Matteo, et al.
Publicado: (2024)

Convergence-Guaranteed Algorithms for l1/2-Regularized Quadratic Programs with Assignment Constraints
por: Xie, Lijun, et al.
Publicado: (2025)

Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems
por: Lapucci, Matteo, et al.
Publicado: (2024)

On the convergence of adaptive first order methods: proximal gradient and alternating minimization algorithms
por: Latafat, Puya, et al.
Publicado: (2023)

Adaptive proximal gradient methods are universal without approximation
por: Oikonomidis, Konstantinos A., et al.
Publicado: (2024)

Adaptive proximal algorithms for convex optimization under local Lipschitz continuity of the gradient
por: Latafat, Puya, et al.
Publicado: (2023)