Inexact proximal linearized algorithm for difference of convex composite functions
From MaRDI portal
Cites work
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A generalized proximal point algorithm for certain non-convex minimization problems
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A nonsmooth version of Newton's method
- A proximal method for composite minimization
- Alternating DC algorithm for partial DC programming problems
- An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
- An inexact regularized proximal Newton method for nonconvex and nonsmooth optimization
- Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
- Clarke Subgradients of Stratifiable Functions
- Composite optimization by nonconvex majorization-minimization
- Composite proximal bundle method
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of some algorithms for convex minimization
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC approximation approaches for sparse optimization
- Descent methods for composite nondifferentiable optimization problems
- Difference-of-convex algorithm with extrapolation for nonconvex, nonsmooth optimization problems
- Efficiency of minimizing compositions of convex functions and smooth maps
- Enhanced proximal DC algorithms with extrapolation for a class of structured nonsmooth DC minimization
- Error bounds, quadratic growth, and linear convergence of proximal methods
- Fast L1-L2 minimization via a proximal operator
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- First-order methods in optimization
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Geometric computation of the numerical radius of a matrix
- Global convergence of a proximal linearized algorithm for difference of convex functions
- scientific article; zbMATH DE number 4032473 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- Implicit Functions and Solution Mappings
- Iterative Solution of Nonlinear Equations in Several Variables
- Learning graph Laplacian with MCP
- Minimizing compositions of differences-of-convex functions with smooth mappings
- On gradients of functions definable in o-minimal structures
- On the convergence of an approximate proximal method for DC functions
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Open issues and recent advances in DC programming and DCA
- Overview of total least-squares methods
- Stochastic DCA for minimizing a large sum of DC functions with application to multi-class logistic regression
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Variational Analysis
- Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
This page was built for publication: Inexact proximal linearized algorithm for difference of convex composite functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7309229)
