Global convergence of a proximal linearized algorithm for difference of convex functions
From MaRDI portal
Publication:331993
DOI10.1007/s11590-015-0969-1zbMath1355.90073OpenAlexW2280318059MaRDI QIDQ331993
Antoine Soubeyran, Paulo Roberto Oliveira, João Carlos O. Souza
Publication date: 27 October 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0969-1
Related Items
The proximal point method with a vectorial Bregman regularization in multiobjective DC programming, Hybrid proximal linearized algorithm for the split DC program in infinite-dimensional real Hilbert spaces, The ABC of DC programming, A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning, An inexact proximal DC algorithm with sieving strategy for rank constrained least squares semidefinite programming, First Order Methods Beyond Convexity and Lipschitz Gradient Continuity with Applications to Quadratic Inverse Problems, A modified proximal point method for DC functions on Hadamard manifolds, A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems, A refined inertial DC algorithm for DC programming, Sequential difference-of-convex programming, Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies, A redistributed bundle algorithm based on local convexification models for nonlinear nonsmooth DC programming, Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations, Aggregate subgradient method for nonsmooth DC optimization, Proximal bundle methods for nonsmooth DC programming, An inertial algorithm for DC programming, Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming, An accelerated smoothing gradient method for nonconvex nonsmooth minimization in image processing, An interior proximal linearized method for DC programming based on Bregman distance or second-order homogeneous kernels, Split proximal linearized algorithm and convergence theorems for the split DC program, Copositivity meets D. C. optimization, A forward-backward algorithm for the DC programming in Hilbert spaces, Learnable Descent Algorithm for Nonsmooth Nonconvex Image Reconstruction
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving DC programs using the cutting angle method
- Generalized inexact proximal algorithms: routine's formation with resistance to change, following worthwhile changes
- A generalized inexact proximal point method for nonsmooth functions that satisfies Kurdyka Łojasiewicz inequality
- On functions representable as a difference of convex functions
- Proximal methods in reflexive Banach spaces without monotonicity
- A proximal point algorithm for DC functions on Hadamard manifolds
- Computing proximal points of nonconvex functions
- Proximal point methods and nonconvex optimization
- A production-transportation problem with stochastic demand and concave production costs
- Error bounds for proximal point subproblems and associated inexact proximal point algorithms
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- DC programming: overview.
- Characterization and recognition of d.c. functions
- Solution of the Multisource Weber and Conditional Weber Problems by D.-C. Programming
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- Convergence of a Proximal Point Method in the Presence of Computational Errors in Hilbert Spaces
- Monotone Operators and the Proximal Point Algorithm
- Inexact Variants of the Proximal Point Algorithm without Monotonicity
- Full convergence of the steepest descent method with inexact line searches
- Hölder Metric Subregularity with Applications to Proximal Point Method
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
