Pages that link to "Item:Q3566718"

The following pages link to Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity (Q3566718):

Displaying 50 items.

• Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints (Q4976346) (← links)
• On steepest descent curves for quasi convex families in Rn (Q4982608) (← links)
• Variable Metric Forward-Backward Algorithm for Composite Minimization Problems (Q4989931) (← links)
• A stochastic alternating direction method of multipliers for non-smooth and non-convex optimization (Q5002572) (← links)
• A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization (Q5024392) (← links)
• Bounding the length of gradient trajectories (Q5028959) (← links)
• An inertial proximal alternating direction method of multipliers for nonconvex optimization (Q5031320) (← links)
• Convex-Concave Backtracking for Inertial Bregman Proximal Gradient Algorithms in Nonconvex Optimization (Q5037570) (← links)
• Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds (Q5070619) (← links)
• Error bounds revisited (Q5077163) (← links)
• Potential Function-Based Framework for Minimizing Gradients in Convex and Min-Max Optimization (Q5093649) (← links)
• A continuous dynamical splitting method for solving ‘strongly+weakly’ convex programming problems (Q5110327) (← links)
• The Proximal Alternating Direction Method of Multipliers in the Nonconvex Setting: Convergence Analysis and Rates (Q5119852) (← links)
• CONVERGENCE TO EQUILIBRIUM FOR A TIME SEMI-DISCRETE DAMPED WAVE EQUATION (Q5121385) (← links)
• Convergence of Inexact Forward--Backward Algorithms Using the Forward--Backward Envelope (Q5131965) (← links)
• An Inertial Newton Algorithm for Deep Learning (Q5159400) (← links)
• A second-order dynamical approach with variable damping to nonconvex smooth minimization (Q5210852) (← links)
• Quantitative Convergence Analysis of Iterated Expansive, Set-Valued Mappings (Q5219693) (← links)
• The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions (Q5221263) (← links)
• Modern regularization methods for inverse problems (Q5230515) (← links)
• A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems (Q5231666) (← links)
• Kurdyka–Łojasiewicz–Simon inequality for gradient flows in metric spaces (Q5234511) (← links)
• Convergence Analysis of Douglas--Rachford Splitting Method for “Strongly + Weakly” Convex Programming (Q5275290) (← links)
• A Bregman Forward-Backward Linesearch Algorithm for Nonconvex Composite Optimization: Superlinear Convergence to Nonisolated Local Minima (Q5853567) (← links)
• Oriented distance point of view on random sets (Q5854376) (← links)
• Generalized Momentum-Based Methods: A Hamiltonian Perspective (Q5857293) (← links)
• Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences (Q5859009) (← links)
• On Optimality Conditions for Nonlinear Conic Programming (Q5868952) (← links)
• The Exact Modulus of the Generalized Concave Kurdyka-Łojasiewicz Property (Q5870355) (← links)
• Hölderian Error Bounds and Kurdyka-Łojasiewicz Inequality for the Trust Region Subproblem (Q5870365) (← links)
• Examples of Pathological Dynamics of the Subgradient Method for Lipschitz Path-Differentiable Functions (Q5870372) (← links)
• Linear convergence of an alternating polar decomposition method for low rank orthogonal tensor approximations (Q6038672) (← links)
• Global convergence of the gradient method for functions definable in o-minimal structures (Q6052062) (← links)
• Fast convergence of inertial dynamics with Hessian-driven damping under geometry assumptions (Q6058513) (← links)
• Bernstein-Remez inequality for algebraic functions: a topological approach (Q6070304) (← links)
• Coercivity and generalized proximal algorithms: application -- traveling around the world (Q6099412) (← links)
• A Systematic Approach to Lyapunov Analyses of Continuous-Time Models in Convex Optimization (Q6116244) (← links)
• A convex function satisfying the Łojasiewicz inequality but failing the gradient conjecture both at zero and infinity (Q6133268) (← links)
• First order inertial optimization algorithms with threshold effects associated with dry friction (Q6146366) (← links)
• On the relationship between the Kurdyka-Łojasiewicz property and error bounds on Hadamard manifolds (Q6151598) (← links)
• Convergence of Random Reshuffling under the Kurdyka–Łojasiewicz Inequality (Q6161313) (← links)
• A forward-backward algorithm with different inertial terms for structured non-convex minimization problems (Q6163956) (← links)
• Calculus rules of the generalized concave Kurdyka-Łojasiewicz property (Q6167075) (← links)
• Fast optimization via inertial dynamics with closed-loop damping (Q6172672) (← links)
• Reexamining low rank matrix factorization for trace norm regularization (Q6195596) (← links)
• Stochastic differential equations for modeling first order optimization methods (Q6490316) (← links)
• A structured L-BFGS method and its application to inverse problems (Q6557640) (← links)
• The level-set subdifferential error bound via Moreau envelopes (Q6561484) (← links)
• A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems (Q6577595) (← links)
• A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems (Q6590593) (← links)