Pages that link to "Item:Q5470208"

The following pages link to Convergence of the Iterates of Descent Methods for Analytic Cost Functions (Q5470208):

Displaying 50 items.

• Nonsmooth bundle trust-region algorithm with applications to robust stability (Q255187) (← links)
• A limited memory BFGS algorithm for non-convex minimization with applications in matrix largest eigenvalue problem (Q283997) (← links)
• Simple examples for the failure of Newton's method with line search for strictly convex minimization (Q304219) (← links)
• A gradient-descent method for curve fitting on Riemannian manifolds (Q431826) (← links)
• Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds (Q441196) (← links)
• The divergence of the BFGS and Gauss Newton methods (Q463731) (← links)
• A study of the dual affine scaling continuous trajectories for linear programming (Q481775) (← links)
• Nonlinear error bounds via a change of function (Q511953) (← links)
• Stabilization of solutions of dissipative Hamiltonian systems (Q536279) (← links)
• Arc-length-based Lyapunov tests for convergence and stability with applications to systems having a continuum of equilibria (Q661021) (← links)
• Dual descent methods as tension reduction systems (Q727232) (← links)
• On the convergence of the proximal algorithm for nonsmooth functions involving analytic features (Q959923) (← links)
• Asymptotic behaviour of self-contracted planar curves and gradient orbits of convex functions (Q987849) (← links)
• Gradient algorithms for polygonal approximation of convex contours (Q1012881) (← links)
• Combining trust-region techniques and Rosenbrock methods to compute stationary points (Q1016405) (← links)
• Local convergence of the heavy-ball method and iPiano for non-convex optimization (Q1637355) (← links)
• From error bounds to the complexity of first-order descent methods for convex functions (Q1675251) (← links)
• Rate of convergence to equilibrium and Łojasiewicz-type estimates (Q1692106) (← links)
• The value function approach to convergence analysis in composite optimization (Q1709968) (← links)
• Convergence analysis of difference-of-convex algorithm with subanalytic data (Q1730802) (← links)
• On accelerating the regularized alternating least-squares algorithm for tensors (Q1744316) (← links)
• Computing the \(p\)-spectral radii of uniform hypergraphs with applications (Q1747024) (← links)
• Accelerating the DC algorithm for smooth functions (Q1749446) (← links)
• Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods (Q1942265) (← links)
• Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems (Q1987437) (← links)
• Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema (Q2018557) (← links)
• The point-wise convergence of shifted symmetric higher order power method (Q2031333) (← links)
• Maximum time step for the BDF3 scheme applied to gradient flows (Q2035643) (← links)
• On the convergence to equilibria of a sequence defined by an implicit scheme (Q2063987) (← links)
• Łojasiewicz gradient inequalities for polynomial functions and some applications (Q2069793) (← links)
• Convergence analysis for gradient flows in the training of artificial neural networks with ReLU activation (Q2079548) (← links)
• A Riemannian gradient ascent algorithm with applications to orthogonal approximation problems of symmetric tensors (Q2085661) (← links)
• Maximum time step for high order BDF methods applied to gradient flows (Q2089083) (← links)
• On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint (Q2089778) (← links)
• Convergence to equilibrium for time and space discretizations of the Cahn-Hilliard equation (Q2090471) (← links)
• Low-rank approximation to entangled multipartite quantum systems (Q2107056) (← links)
• Avoiding bad steps in Frank-Wolfe variants (Q2111475) (← links)
• A survey on some recent developments of alternating direction method of multipliers (Q2136506) (← links)
• The developments of proximal point algorithms (Q2158107) (← links)
• Riemannian conjugate gradient methods for computing the extreme eigenvalues of symmetric tensors (Q2163582) (← links)
• Cooling down stochastic differential equations: Almost sure convergence (Q2169074) (← links)
• On the Łojasiewicz-Simon gradient inequality on submanifolds (Q2192364) (← links)
• Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments (Q2234294) (← links)
• Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality (Q2251554) (← links)
• Computing Riemannian center of mass on Hadamard manifolds (Q2278890) (← links)
• Non-genericity of initial data with punctual \(\omega \)-limit set (Q2291680) (← links)
• Multiplicative noise removal via using nonconvex regularizers based on total variation and wavelet frame (Q2297111) (← links)
• Multiscale sparse microcanonical models (Q2319816) (← links)
• Quadratic optimization with orthogonality constraint: explicit Łojasiewicz exponent and linear convergence of retraction-based line-search and stochastic variance-reduced gradient methods (Q2330648) (← links)
• Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates (Q2349844) (← links)