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)- An alternating semiproximal method for nonconvex regularized structured total least squares problems
- On DC based methods for phase retrieval
- Choose your path wisely: gradient descent in a Bregman distance framework
- Convergence of the time-discretized monotonic schemes
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- Malitsky-Tam forward-reflected-backward splitting method for nonconvex minimization problems
- Computing Riemannian center of mass on Hadamard manifolds
- An abstract convergence framework with application to inertial inexact forward-backward methods
- Nonsmooth optimization by successive abs-linearization in function spaces
- Novel DCA based algorithms for a special class of nonconvex problems with application in machine learning
- Proximal linearization methods for Schatten \(p\)-quasi-norm minimization
- A block inertial Bregman proximal algorithm for nonsmooth nonconvex problems with application to symmetric nonnegative matrix tri-factorization
- 5D respiratory motion model based image reconstruction algorithm for 4D cone-beam computed tomography
- An inexact Riemannian proximal gradient method
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
- A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
- Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
- On the geometric analysis of a quartic-quadratic optimization problem under a spherical constraint
- A Barzilai-Borwein gradient algorithm for spatio-temporal Internet traffic data completion via tensor triple decomposition
- The convergence properties of infeasible inexact proximal alternating linearized minimization
- New Bregman proximal type algoritms for solving DC optimization problems
- MAP inference via \(\ell_2\)-sphere linear program reformulation
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- PCA reduced Gaussian mixture models with applications in superresolution
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Global convergence of model function based Bregman proximal minimization algorithms
- Triple decomposition and tensor recovery of third order tensors
- New convergence results for the inexact variable metric forward-backward method
- Algorithms based on ABS-linearization for non-smooth optimization with PDE constraints
- A hybrid Bregman alternating direction method of multipliers for the linearly constrained difference-of-convex problems
- A difference-of-convex approach for split feasibility with applications to matrix factorizations and outlier detection
- Convergence rates for an inertial algorithm of gradient type associated to a smooth non-convex minimization
- Multi-block nonconvex nonsmooth proximal ADMM: convergence and rates under Kurdyka-Łojasiewicz property
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- A survey on some recent developments of alternating direction method of multipliers
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- Kurdyka-Łojasiewicz exponent via inf-projection
- Separating variables to accelerate non-convex regularized optimization
- An inertial Bregman generalized alternating direction method of multipliers for nonconvex optimization
- Inertial stochastic PALM and applications in machine learning
- On the convergence to equilibria of a sequence defined by an implicit scheme
- Numerical study of the stock market crises based on mean field games approach
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Unifying abstract inexact convergence theorems and block coordinate variable metric iPiano
- Asymptotics for some discretizations of dynamical systems, application to second order systems with non-local nonlinearities
- A proximal interior point algorithm with applications to image processing
- An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming
- Moreau envelope augmented Lagrangian method for nonconvex optimization with linear constraints
- Inertial alternating direction method of multipliers for non-convex non-smooth optimization
- The developments of proximal point algorithms
- Proximal-like incremental aggregated gradient method with Bregman distance in weakly convex optimization problems
- Non-convex split Feasibility problems: models, algorithms and theory
- 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
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)
