Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
DOI10.1007/s11228-017-0411-1zbMath1452.90250arXiv1610.00911OpenAlexW2964333704WikidataQ59607314 ScholiaQ59607314MaRDI QIDQ1653320
Ernö Robert Csetnek, Radu Ioan Boţ
Publication date: 3 August 2018
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.00911
nonsmooth optimizationdynamical systemsLyapunov analysislimiting subdifferentialKurdyka-Łojasiewicz propertyregularization function
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Monotone operators and generalizations (47H05) Iterative procedures involving nonlinear operators (47J25) Evolution inclusions (34G25)
Related Items
Uses Software
Cites Work
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Fast convex optimization via inertial dynamics with Hessian driven damping
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Continuous gradient projection method in Hilbert spaces
- Approaching the solving of constrained variational inequalities via penalty term-based dynamical systems
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- A dynamical system associated with Newton's method for parametric approximations of convex minimization problems
- On gradients of functions definable in o-minimal structures
- A second-order gradient-like dissipative dynamical system with Hessian-driven damping. Application to optimization and mechanics.
- From error bounds to the complexity of first-order descent methods for convex functions
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Newton-like dynamics and forward-backward methods for structured monotone inclusions in Hilbert spaces
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Asymptotic behavior of coupled dynamical systems with multiscale aspects
- Techniques of variational analysis
- Second Order Forward-Backward Dynamical Systems For Monotone Inclusion Problems
- A dynamic approach to a proximal-Newton method for monotone inclusions in Hilbert spaces, with complexity O(1/n^2)
- iPiano: Inertial Proximal Algorithm for Nonconvex Optimization
- A Continuous Dynamical Newton-Like Approach to Solving Monotone Inclusions
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Dynamical systems and forward–backward algorithms associated with the sum of a convex subdifferential and a monotone cocoercive operator
- Clarke Subgradients of Stratifiable Functions
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Variational Analysis
- THE HEAVY BALL WITH FRICTION METHOD, I. THE CONTINUOUS DYNAMICAL SYSTEM: GLOBAL EXPLORATION OF THE LOCAL MINIMA OF A REAL-VALUED FUNCTION BY ASYMPTOTIC ANALYSIS OF A DISSIPATIVE DYNAMICAL SYSTEM
- A forward-backward-forward differential equation and its asymptotic properties
- Variational Analysis and Generalized Differentiation I
- A Dynamical Approach to an Inertial Forward-Backward Algorithm for Convex Minimization
- Proximal Heterogeneous Block Implicit-Explicit Method and Application to Blind Ptychographic Diffraction Imaging
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convex analysis and monotone operator theory in Hilbert spaces
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item