On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
From MaRDI portal
Publication:959923
DOI10.1007/S10107-007-0133-5zbMATH Open1165.90018OpenAlexW2078853581WikidataQ126263809 ScholiaQ126263809MaRDI QIDQ959923FDOQ959923
Authors: Hédy Attouch, Jérôme Bolte 
Publication date: 16 December 2008
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-007-0133-5
Recommendations
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- scientific article; zbMATH DE number 1062747
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Inertial proximal alternating minimization for nonconvex and nonsmooth problems
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Cites Work
- Variational Analysis
- Geometric categories and o-minimal structures
- Title not available (Why is that?)
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Asymptotics for a class of non-linear evolution equations, with applications to geometric problems
- On gradients of functions definable in o-minimal structures
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Proximal point methods and nonconvex optimization
- Submonotone mappings and the proximal point algorithm
- Proximal Methods for Cohypomonotone Operators
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Title not available (Why is that?)
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
- Inertia and reactivity in decision making as cognitive variational inequalities
- Title not available (Why is that?)
- A nonsmooth Morse--Sard theorem for subanalytic functions
- On numerical solution of hemivariational inequalities by nonsmooth optimization methods
- Mixed Coderivatives of Set–Valued Mappings in Variational Analysis
Cited In (only showing first 100 items - show all)
- On the proximal gradient algorithm with alternated inertia
- Bregman proximal gradient algorithms for deep matrix factorization
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization
- Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- Games and cost of change
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Proximal algorithms in statistics and machine learning
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- From error bounds to the complexity of first-order descent methods for convex functions
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Accelerating the DC algorithm for smooth functions
- DC programming and DCA: thirty years of developments
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Computing extreme eigenvalues of large scale Hankel tensors
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- A regularization interpretation of the proximal point method for weakly convex functions
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- Extragradient method in optimization: convergence and complexity
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Dual descent methods as tension reduction systems
- A block coordinate variable metric forward-backward algorithm
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- The Kurdyka-Łojasiewicz inequality as regularity condition
- A general double-proximal gradient algorithm for d.c. programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An inexact proximal method for quasiconvex minimization
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off
- Inexact proximal point methods in metric spaces
- Local search proximal algorithms as decision dynamics with costs to move
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- Convergence to equilibrium for a second-order time semi-discretization of the Cahn-Hilliard equation
- Proximal heterogeneous block implicit-explicit method and application to blind ptychographic diffraction imaging
- A numerical analysis of the Cahn-Hilliard equation with non-permeable walls
- A new alternating direction method for linearly constrained nonconvex optimization problems
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- A proximal alternating linearization method for minimizing the sum of two convex functions
- Convergence of ADMM for multi-block nonconvex separable optimization models
- A proximal iterative approach to a non-convex optimization problem
- Convergence analysis for iterative data-driven tight frame construction scheme
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- A proximal algorithm with quasi distance. Application to habit's formation
- Title not available (Why is that?)
- Convergence of iterative hard-thresholding algorithm with continuation
- Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
- Error bounds and Hölder metric subregularity
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- A monotonic method for nonlinear optimal control problems with concave dependence on the state
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- Composite difference-MAX programs for modern statistical estimation problems
- Proximal Gradient Methods for Machine Learning and Imaging
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- A proximal difference-of-convex algorithm with extrapolation
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Optimal convergence rates for Nesterov acceleration
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Non-Lipschitz models for image restoration with impulse noise removal
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- A proximal DC approach for quadratic assignment problem
This page was built for publication: On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q959923)
