On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
From MaRDI portal
(Redirected from Publication:959923)
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
Cites work
- scientific article; zbMATH DE number 3772598 (Why is no real title available?)
- scientific article; zbMATH DE number 45943 (Why is no real title available?)
- scientific article; zbMATH DE number 1201576 (Why is no real title available?)
- scientific article; zbMATH DE number 563657 (Why is no real title available?)
- scientific article; zbMATH DE number 1113627 (Why is no real title available?)
- A nonsmooth Morse--Sard theorem for subanalytic functions
- Asymptotics for a class of non-linear evolution equations, with applications to geometric problems
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Geometric categories and o-minimal structures
- Inertia and reactivity in decision making as cognitive variational inequalities
- Local Convergence of the Proximal Point Algorithm and Multiplier Methods Without Monotonicity
- Maximum principle in the problem of time optimal response with nonsmooth constraints
- Mixed Coderivatives of Set–Valued Mappings in Variational Analysis
- On gradients of functions definable in o-minimal structures
- On numerical solution of hemivariational inequalities by nonsmooth optimization methods
- Proximal Methods for Cohypomonotone Operators
- Proximal point methods and nonconvex optimization
- Regularized Lotka-Volterra dynamical system as continuous proximal-like method in optimization.
- Submonotone mappings and the proximal point algorithm
- The gradient and heavy ball with friction dynamical systems: The quasiconvex case
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Variational Analysis
- 𝒱𝒰-smoothness and proximal point results for some nonconvex functions
Cited in
(only showing first 100 items - show all)- A forward-backward dynamical approach to the minimization of the sum of a nonsmooth convex with a smooth nonconvex function
- Convergence of iterative hard-thresholding algorithm with continuation
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- A proximal alternating linearization method for minimizing the sum of two convex functions
- A Bregman-style partially symmetric alternating direction method of multipliers for nonconvex multi-block optimization
- Accelerating the DC algorithm for smooth functions
- DC programming and DCA: thirty years of developments
- Convergence analysis for iterative data-driven tight frame construction scheme
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- Inexact proximal point methods in metric spaces
- A Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Finite termination of inexact proximal point algorithms in Hilbert spaces
- Inexact proximal point methods for quasiconvex minimization on Hadamard manifolds
- Convergence analysis of inexact proximal point algorithms on Hadamard manifolds
- 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
- Local search proximal algorithms as decision dynamics with costs to move
- Extragradient method in optimization: convergence and complexity
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- An iterative support shrinking algorithm for non-Lipschitz optimization in image restoration
- Computing extreme eigenvalues of large scale Hankel tensors
- Characterizations of Łojasiewicz inequalities: Subgradient flows, talweg, convexity
- Proximal point algorithms on Hadamard manifolds: linear convergence and finite termination
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- The proximal alternating iterative hard thresholding method for \(l_0\) minimization, with complexity \(\mathcal{O}(1/\sqrt{k})\)
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- Computing eigenvalues of large scale sparse tensors arising from a hypergraph
- A new alternating direction method for linearly constrained nonconvex optimization problems
- On the proximal gradient algorithm with alternated inertia
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- An extended proximal ADMM algorithm for three-block nonconvex optimization problems
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Bregman proximal gradient algorithms for deep matrix factorization
- Convergence to equilibrium for a second-order time semi-discretization of the Cahn-Hilliard equation
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- A remark on accelerated block coordinate descent for computing the proximity operators of a sum of convex functions
- Thresholding gradient methods in Hilbert spaces: support identification and linear convergence
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
- Minimization of \(L_1\) over \(L_2\) for sparse signal recovery with convergence guarantee
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- Dual descent methods as tension reduction systems
- A block coordinate variable metric forward-backward algorithm
- A globally convergent algorithm for nonconvex optimization based on block coordinate update
- Convergence of ADMM for multi-block nonconvex separable optimization models
- A regularization interpretation of the proximal point method for weakly convex functions
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Error bounds and Hölder metric subregularity
- An inexact proximal method for quasiconvex minimization
- Convergence results for projected line-search methods on varieties of low-rank matrices via Łojasiewicz inequality
- GAITA: a Gauss-Seidel iterative thresholding algorithm for \(\ell_q\) regularized least squares regression
- Proximal heterogeneous block implicit-explicit method and application to blind ptychographic diffraction imaging
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- The Kurdyka-Łojasiewicz inequality as regularity condition
- A general double-proximal gradient algorithm for d.c. programming
- A proximal iterative approach to a non-convex optimization problem
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- Splitting methods with variable metric for Kurdyka-Łojasiewicz functions and general convergence rates
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- A numerical analysis of the Cahn-Hilliard equation with non-permeable walls
- Proximal algorithms in statistics and machine learning
- scientific article; zbMATH DE number 7599681 (Why is no real title available?)
- Convergence of alternating direction method for minimizing sum of two nonconvex functions with linear constraints
- Variable Metric Forward-Backward Algorithm for Composite Minimization Problems
- Games and cost of change
- Local convergence of the Levenberg-Marquardt method under Hölder metric subregularity
- A proximal algorithm with quasi distance. Application to habit's formation
- Proximal point method on Finslerian manifolds and the ``effort-accuracy trade-off
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- Composite difference-MAX programs for modern statistical estimation problems
- A nonconvex ADMM for a class of sparse inverse semidefinite quadratic programming problems
- Nonconvex Lagrangian-based optimization: monitoring schemes and global convergence
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- On convergence rates of proximal alternating direction method of multipliers
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- Convergence of the forward-backward algorithm: beyond the worst-case with the help of geometry
- Convergence rate analysis of proximal iteratively reweighted \(\ell_1\) methods for \(\ell_p\) regularization problems
- Analysis and algorithms for some compressed sensing models based on L1/L2 minimization
- Maximum time step for the BDF3 scheme applied to gradient flows
- Proximal Gradient Methods for Machine Learning and Imaging
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- Convergence rates of damped inertial dynamics under geometric conditions and perturbations
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- A proximal DC approach for quadratic assignment problem
- An accelerated IRNN-iteratively reweighted nuclear norm algorithm for nonconvex nonsmooth low-rank minimization problems
- Effective two-stage image segmentation: a new non-Lipschitz decomposition approach with convergent algorithm
- Novel reformulations and efficient algorithms for the generalized trust region subproblem
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- A simplified view of first order methods for optimization
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
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)
