The boosted double-proximal subgradient algorithm for nonconvex optimization
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- scientific article; zbMATH DE number 823375 (Why is no real title available?)
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
- A boosted DC algorithm for non-differentiable DC components with non-monotone line search
- A general double-proximal gradient algorithm for d.c. programming
- A heuristic algorithm for solving the minimum sum-of-squares clustering problems
- A new boosted proximal point algorithm for minimizing nonsmooth DC functions
- A product space reformulation with reduced dimension for splitting algorithms
- A proximal difference-of-convex algorithm with extrapolation
- A proximal subgradient algorithm with extrapolation for structured nonconvex nonsmooth problems
- A variational formulation for frame-based inverse problems
- A weighted difference of anisotropic and isotropic total variation model for image processing
- Accelerating the DC algorithm for smooth functions
- An inertial algorithm for DC programming
- An inertial forward-backward algorithm for the minimization of the sum of two nonconvex functions
- Applications of variational analysis to a generalized heron problem
- Backtracking gradient descent method and some applications in large scale optimisation. II: Algorithms and experiments
- Coderivative-based semi-Newton method in nonsmooth difference programming
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Convergence of New Inertial Proximal Methods for DC Programming
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of non-smooth descent methods using the Kurdyka-Łojasiewicz inequality
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Minimization of functions having Lipschitz continuous first partial derivatives
- Necessary and sufficient optimality conditions in DC semi-infinite programming
- Newton-Type Methods for Optimization and Variational Problems
- Nonlinear optimization
- On gradients of functions definable in o-minimal structures
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- On the subdifferentiability of the difference of two functions and local minimization
- Optimality conditions in DC-constrained mathematical programming problems
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Solving a generalized Heron problem by means of convex analysis
- Some sharp performance bounds for least squares regression with L₁ regularization
- The ABC of DC programming
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The boosted DC algorithm for linearly constrained DC programming
- Variational Analysis
- Variational analysis and applications
This page was built for publication: The boosted double-proximal subgradient algorithm for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6885415)
