Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem
From MaRDI portal
Publication:5870365
DOI10.1287/moor.2021.1243OpenAlexW2990364438MaRDI QIDQ5870365
Publication date: 9 January 2023
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1911.11955
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Quadratic programming (90C20) Nonsmooth analysis (49J52)
Related Items
Linear Convergence of a Proximal Alternating Minimization Method with Extrapolation for \(\boldsymbol{\ell_1}\) -Norm Principal Component Analysis, Avoiding bad steps in Frank-Wolfe variants
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A linear-time algorithm for trust region problems
- Douglas-Rachford splitting for nonconvex optimization with application to nonconvex feasibility problems
- The generalized trust region subproblem
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- Error bounds: necessary and sufficient conditions
- Duallity and sensitivity in nonconvex quadratic optimization over an ellipsoid
- Error bounds and convergence analysis of feasible descent methods: A general approach
- On semi- and subanalytic geometry
- Error bounds in mathematical programming
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- SOCP reformulation for the generalized trust region subproblem via a canonical form of two symmetric matrices
- From error bounds to the complexity of first-order descent methods for convex functions
- A unified approach to error bounds for structured convex optimization problems
- A linear-time algorithm for the trust region subproblem based on hidden convexity
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- On error bound moduli for locally Lipschitz and regular functions
- Nonsmooth optimization using Taylor-like models: error bounds, convergence, and termination criteria
- Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods
- On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
- Recent advances in trust region algorithms
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Introduction to Nonlinear Optimization
- METRIC REGULARITY—A SURVEY PART 1. THEORY
- A Derivative-Free Algorithm for Least-Squares Minimization
- Weak Sharp Minima in Mathematical Programming
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- A Nested Lanczos Method for the Trust-Region Subproblem
- Computing a Trust Region Step
- Implicit Functions and Solution Mappings
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
- Error Bound and Convergence Analysis of Matrix Splitting Algorithms for the Affine Variational Inequality Problem
- Local Minimizers of Quadratic Functions on Euclidean Balls and Spheres
- Trust Region Methods
- Globally Solving the Trust Region Subproblem Using Simple First-Order Methods
- Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions
- Non-asymptotic convergence analysis of inexact gradient methods for machine learning without strong convexity
- The trust region subproblem and semidefinite programming*
- Solving the Trust-Region Subproblem using the Lanczos Method
- Global error bounds for convex quadratic inequality systems*
- Error Bounds for Piecewise Convex Quadratic Programs and Applications
- Prox-regular functions in variational analysis
- Closing the Gap between Necessary and Sufficient Conditions for Local Nonglobal Minimizer of Trust Region Subproblem
- Second-order growth, tilt stability, and metric regularity of the subdifferential
- Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming
- Error Bounds, Quadratic Growth, and Linear Convergence of Proximal Methods
- Novel Reformulations and Efficient Algorithms for the Generalized Trust Region Subproblem
- Tilt Stability, Uniform Quadratic Growth, and Strong Metric Regularity of the Subdifferential
- A Second-Order Cone Based Approach for Solving the Trust-Region Subproblem and Its Variants
- On the Generalized Lanczos Trust-Region Method
- A Linear-Time Algorithm for Generalized Trust Region Subproblems
- Mini-batch stochastic approximation methods for nonconvex stochastic composite optimization
