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 Stochastic Proximal Alternating Minimization for Nonsmooth and Nonconvex Optimization
- Separating variables to accelerate non-convex regularized optimization
- Bregman proximal gradient algorithms for deep matrix factorization
- On the proximal gradient algorithm with alternated inertia
- Approximate versions of proximal iteratively reweighted algorithms including an extended IP-ICMM for signal and image processing problems
- An inexact Riemannian proximal gradient method
- A globally convergent algorithm for a class of gradient compounded non-Lipschitz models applied to non-additive noise removal
- Asymptotic behavior of an adapted implicit discretization of slowly damped second order dynamical systems
- Sequence convergence of inexact nonconvex and nonsmooth algorithms with more realistic assumptions
- Block Bregman majorization minimization with extrapolation
- Convergence of inexact forward-backward algorithms using the forward-backward envelope
- Convergence Analysis of the Proximal Gradient Method in the Presence of the Kurdyka–Łojasiewicz Property Without Global Lipschitz Assumptions
- Complexity of a quadratic penalty accelerated inexact proximal point method for solving linearly constrained nonconvex composite programs
- A monotonic method for nonlinear optimal control problems with concave dependence on the state
- A Proximal Minimization Algorithm for Structured Nonconvex and Nonsmooth Problems
- A tensor optimization algorithm for computing Lagrangians of hypergraphs
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- 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
- Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- Continuous dynamics related to monotone inclusions and non-smooth optimization problems
- Games and cost of change
- Asymptotics for some discretizations of dynamical systems, application to second order systems with non-local nonlinearities
- Convergence rate analysis of an extrapolated proximal difference-of-convex algorithm
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- The level-set subdifferential error bound via Moreau envelopes
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Full convergence of the proximal point method for quasiconvex functions on Hadamard manifolds
- The proximal alternating direction method of multipliers in the nonconvex setting: convergence analysis and rates
- Continuous exact relaxation and alternating proximal gradient algorithm for partial sparse and partial group sparse optimization problems
- Conditions for linear convergence of the gradient method for non-convex optimization
- Inertial stochastic PALM and applications in machine learning
- Proximal algorithms in statistics and machine learning
- An extrapolated iteratively reweighted \(\ell_1\) method with complexity analysis
- Alternating structure-adapted proximal gradient descent for nonconvex nonsmooth block-regularized problems
- New Bregman proximal type algoritms for solving DC optimization problems
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- A subgradient-based approach for finding the maximum feasible subsystem with respect to a set
- Relaxing Kink Qualifications and Proving Convergence Rates in Piecewise Smooth Optimization
- Łojasiewicz inequalities with explicit exponents for smallest singular value functions
- Forward-backward envelope for the sum of two nonconvex functions: further properties and nonmonotone linesearch algorithms
- Efficient Boosted DC Algorithm for Nonconvex Image Restoration with Rician Noise
- 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
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- An incremental aggregated proximal ADMM for linearly constrained nonconvex optimization with application to sparse logistic regression problems
- A second-order dynamical approach with variable damping to nonconvex smooth minimization
- Convergence of Bregman Peaceman-Rachford splitting method for nonconvex nonseparable optimization
- A new approach to the proximal point method: convergence on general Riemannian manifolds
- 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 combined dictionary learning and TV model for image restoration with convergence analysis
- An inertial Tseng's type proximal algorithm for nonsmooth and nonconvex optimization problems
- Composite difference-MAX programs for modern statistical estimation problems
- A proximal difference-of-convex algorithm with extrapolation
- Proximal Gradient Methods for Machine Learning and Imaging
- On the convergence of the iterates of proximal gradient algorithm with extrapolation for convex nonsmooth minimization problems
- From error bounds to the complexity of first-order descent methods for convex functions
- Smooth robust tensor completion for background/foreground separation with missing pixels: novel algorithm with convergence guarantee
- Some accelerated alternating proximal gradient algorithms for a class of nonconvex nonsmooth problems
- Variable metric forward-backward algorithm for minimizing the sum of a differentiable function and a convex function
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Convergence of the time-discretized monotonic schemes
- Convergence and rate analysis of a proximal linearized ADMM for nonconvex nonsmooth optimization
- Quaternion-based color image completion via logarithmic approximation
- Efficiency of higher-order algorithms for minimizing composite functions
- Convergence Rate Analysis of a Sequential Convex Programming Method with Line Search for a Class of Constrained Difference-of-Convex Optimization Problems
- On a general smoothly truncated regularization for variational piecewise constant image restoration: construction and convergent algorithms
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Nonsmooth optimization by successive abs-linearization in function spaces
- Accelerating the DC algorithm for smooth functions
- DC programming and DCA: thirty years of developments
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Convergence of a Class of Nonmonotone Descent Methods for Kurdyka–Łojasiewicz Optimization Problems
- A stochastic two-step inertial Bregman proximal alternating linearized minimization algorithm for nonconvex and nonsmooth problems
- A seminorm regularized alternating least squares algorithm for canonical tensor decomposition
- A refined inertial DC algorithm for DC programming
- 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
- Convex-concave backtracking for inertial Bregman proximal gradient algorithms in nonconvex optimization
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Kurdyka-Łojasiewicz exponent via inf-projection
- A preconditioned alternating minimization framework for nonconvex and half quadratic regularization
- Convergence to equilibrium for solutions of some forced discretized second-order gradient-like systems
- An inexact proximal gradient algorithm with extrapolation for a class of nonconvex nonsmooth optimization problems
- A simple globally convergent algorithm for the nonsmooth nonconvex single source localization problem
- Computing extreme eigenvalues of large scale Hankel tensors
- A regularization interpretation of the proximal point method for weakly convex functions
- Calculus rules of the generalized concave Kurdyka-Łojasiewicz property
- Approaching nonsmooth nonconvex minimization through second-order proximal-gradient dynamical systems
- Local convergence of the heavy-ball method and iPiano for non-convex optimization
- An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
- Optimal convergence rates for Nesterov acceleration
- Convergence rates of an inertial gradient descent algorithm under growth and flatness conditions
- A nonmonotone accelerated proximal gradient method with variable stepsize strategy for nonsmooth and nonconvex minimization problems
- Doubly iteratively reweighted algorithm for constrained compressed sensing models
- Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound
- Extragradient method in optimization: convergence and complexity
- Proximal point method for minimizing quasiconvex locally Lipschitz functions on Hadamard manifolds
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)
