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)- 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
- Approaching nonsmooth nonconvex optimization problems through first order dynamical systems with hidden acceleration and Hessian driven damping terms
- Iteratively reweighted \(\ell _1\) algorithms with extrapolation
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- Modern regularization methods for inverse problems
- Alternating DC algorithm for partial DC programming problems
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- Bregman reweighted alternating minimization and its application to image deblurring
- Convergence and dynamical behavior of the ADAM algorithm for nonconvex stochastic optimization
- Non-Lipschitz models for image restoration with impulse noise removal
- New analysis of linear convergence of gradient-type methods via unifying error bound conditions
- A forward-backward algorithm with different inertial terms for structured non-convex minimization problems
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- A numerical analysis of the coupled Cahn-Hilliard/Allen-Cahn system with dynamic boundary conditions
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- A gradient-type algorithm with backward inertial steps associated to a nonconvex minimization problem
- Convergence analysis of the generalized splitting methods for a class of nonconvex optimization problems
- An inertial proximal alternating direction method of multipliers for nonconvex optimization
- Global convergence of proximal iteratively reweighted algorithm
- Precompact convergence of the nonconvex primal-dual hybrid gradient algorithm
- Difference-of-Convex Algorithms for a Class of Sparse Group $\ell_0$ Regularized Optimization Problems
- A new nonconvex approach to low-rank matrix completion with application to image inpainting
- Optimal convergence rates for Nesterov acceleration
- A proximal difference-of-convex algorithm with extrapolation
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- A refined convergence analysis of \(\mathrm{pDCA}_{e}\) with applications to simultaneous sparse recovery and outlier detection
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- A block coordinate variable metric linesearch based proximal gradient method
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- Gradient stability of high-order BDF methods and some applications
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- A monotonic method for nonlinear optimal control problems with concave dependence on the state
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Majorization-minimization procedures and convergence of SQP methods for semi-algebraic and tame programs
- A Symmetric Alternating Direction Method of Multipliers for Separable Nonconvex Minimization Problems
- The value function approach to convergence analysis in composite optimization
- Forward-backward quasi-Newton methods for nonsmooth optimization problems
- A preconditioned difference of convex algorithm for truncated quadratic regularization with application to imaging
- An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
- 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
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)
