Convergence of the Iterates of Descent Methods for Analytic Cost Functions
From MaRDI portal
Publication:5470208
DOI10.1137/040605266zbMath1092.90036OpenAlexW2077612096WikidataQ125997516 ScholiaQ125997516MaRDI QIDQ5470208
No author found.
Publication date: 30 May 2006
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/040605266
line searchdescent methodstrust regiongradient flowsMexican hatreal analytic functionsLojasiewicz gradient inequalitysingle limit-point convergence
Nonconvex programming, global optimization (90C26) Numerical optimization and variational techniques (65K10) Dynamical systems in optimization and economics (37N40) Methods of reduced gradient type (90C52)
Related Items (only showing first 100 items - show all)
Jacobi-type algorithms for homogeneous polynomial optimization on Stiefel manifolds with applications to tensor approximations ⋮ Global convergence of the gradient method for functions definable in o-minimal structures ⋮ Lyapunov stability of the subgradient method with constant step size ⋮ Analysis of the optimization landscape of Linear Quadratic Gaussian (LQG) control ⋮ Convergence of the Momentum Method for Semialgebraic Functions with Locally Lipschitz Gradients ⋮ Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions ⋮ A fast and simple modification of Newton's method avoiding saddle points ⋮ A geometric approach of gradient descent algorithms in linear neural networks ⋮ Convergence of Gradient-Based Block Coordinate Descent Algorithms for Nonorthogonal Joint Approximate Diagonalization of Matrices ⋮ Convergence of inexact steepest descent algorithm for multiobjective optimizations on Riemannian manifolds without curvature constraints ⋮ Quantifying measurement-induced disturbance to distinguish correlations as classical or quantum ⋮ Asymptotic behavior of an adapted implicit discretization of slowly damped second order dynamical systems ⋮ Sufficient Conditions for Instability of the Subgradient Method with Constant Step Size ⋮ Sequential Model Correction for Nonlinear Inverse Problems ⋮ A complex-valued gradient flow for the entangled bipartite low rank approximation ⋮ Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality ⋮ Sequential gradient dynamics in real analytic Morse systems ⋮ A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem ⋮ A survey on some recent developments of alternating direction method of multipliers ⋮ \(H_2\) optimal reduced models of general MIMO LTI systems via the cross Gramian on the Stiefel manifold ⋮ Algorithms Based on Abs-Linearization for Non-smooth Optimization with PDE Constraints ⋮ Simple examples for the failure of Newton's method with line search for strictly convex minimization ⋮ The Optimization Landscape for Fitting a Rank-2 Tensor with a Rank-1 Tensor ⋮ Local convergence of the heavy-ball method and iPiano for non-convex optimization ⋮ Łojasiewicz inequality and exponential convergence of the full‐range model of CNNs ⋮ Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds ⋮ Tensor Canonical Correlation Analysis With Convergence and Statistical Guarantees ⋮ The developments of proximal point algorithms ⋮ Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors ⋮ Convergence Analysis on SS-HOPM for BEC-Like Nonlinear Eigenvalue Problems ⋮ Cooling down stochastic differential equations: Almost sure convergence ⋮ Gradient Flows, Second-Order Gradient Systems and Convexity ⋮ From error bounds to the complexity of first-order descent methods for convex functions ⋮ Counterexamples in synchronization: pathologies of consensus seeking gradient descent flows on surfaces ⋮ Asymptotics for some discretizations of dynamical systems, application to second order systems with non-local nonlinearities ⋮ Convergence Results for Projected Line-Search Methods on Varieties of Low-Rank Matrices Via Łojasiewicz Inequality ⋮ The Fiedler Vector of a Laplacian Tensor for Hypergraph Partitioning ⋮ On the Łojasiewicz-Simon gradient inequality on submanifolds ⋮ Rate of convergence to equilibrium and Łojasiewicz-type estimates ⋮ Unnamed Item ⋮ Solving an inverse eigenvalue problem with triple constraints on eigenvalues, singular values, and diagonal elements ⋮ First-order methods almost always avoid strict saddle points ⋮ Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods ⋮ Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry ⋮ Every ordinary differential equation with a strict Lyapunov function is a gradient system ⋮ A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems ⋮ A gradient-descent method for curve fitting on Riemannian manifolds ⋮ An abstract convergence framework with application to inertial inexact forward-backward methods ⋮ On global convergence of alternating least squares for tensor approximation ⋮ Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds ⋮ The value function approach to convergence analysis in composite optimization ⋮ Approximate Matrix and Tensor Diagonalization by Unitary Transformations: Convergence of Jacobi-Type Algorithms ⋮ The divergence of the BFGS and Gauss Newton methods ⋮ An unconstrained H 2 model order reduction optimisation algorithm based on the Stiefel manifold for bilinear systems ⋮ Unifying Abstract Inexact Convergence Theorems and Block Coordinate Variable Metric iPiano ⋮ A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems ⋮ Efficient algorithms for optimal control of quantum dynamics: the Krotov method unencumbered ⋮ Arc-length-based Lyapunov tests for convergence and stability with applications to systems having a continuum of equilibria ⋮ Convergence analysis of difference-of-convex algorithm with subanalytic data ⋮ A study of the dual affine scaling continuous trajectories for linear programming ⋮ Multidimensional Exploratory Analysis of a Structural Model Using a Class of Generalized Covariance Criteria ⋮ The Kurdyka–Łojasiewicz Inequality as Regularity Condition ⋮ Local Minimizers of Semi-Algebraic Functions from the Viewpoint of Tangencies ⋮ A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal ⋮ Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments ⋮ On accelerating the regularized alternating least-squares algorithm for tensors ⋮ Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems ⋮ Computing the \(p\)-spectral radii of uniform hypergraphs with applications ⋮ Nonlinear error bounds via a change of function ⋮ Accelerating the DC algorithm for smooth functions ⋮ Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity ⋮ On the convergence of the proximal algorithm for nonsmooth functions involving analytic features ⋮ Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality ⋮ Stabilization of solutions of dissipative Hamiltonian systems ⋮ Unnamed Item ⋮ An application of Lie groups in distributed control networks ⋮ Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema ⋮ Nonsmooth Riemannian Optimization with Applications to Sphere Packing and Grasping ⋮ ŁOJASIEWICZ-TYPE INEQUALITIES AND GLOBAL ERROR BOUNDS FOR NONSMOOTH DEFINABLE FUNCTIONS IN O-MINIMAL STRUCTURES ⋮ Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions ⋮ Computing Riemannian center of mass on Hadamard manifolds ⋮ On the stable equilibrium points of gradient systems ⋮ The point-wise convergence of shifted symmetric higher order power method ⋮ Dual descent methods as tension reduction systems ⋮ Maximum time step for the BDF3 scheme applied to gradient flows ⋮ A computational framework of gradient flows for general linear matrix equations ⋮ Non-genericity of initial data with punctual \(\omega \)-limit set ⋮ Gradient stability of high-order BDF methods and some applications ⋮ Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs ⋮ Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame ⋮ Gradient algorithms for polygonal approximation of convex contours ⋮ Combining trust-region techniques and Rosenbrock methods to compute stationary points ⋮ A self-adaptive regularized alternating least squares method for tensor decomposition problems ⋮ Exotic equilibria of Harary graphs and a new minimum degree lower bound for synchronization ⋮ Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints ⋮ On the convergence to equilibria of a sequence defined by an implicit scheme ⋮ Numerical aspects of large-time optimal control of Burgers equation ⋮ Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems ⋮ Łojasiewicz gradient inequalities for polynomial functions and some applications ⋮ Computing Eigenvalues of Large Scale Sparse Tensors Arising from a Hypergraph
This page was built for publication: Convergence of the Iterates of Descent Methods for Analytic Cost Functions
