Sequential difference-of-convex programming
From MaRDI portal
Recommendations
- An inexact successive quadratic approximation method for a class of difference-of-convex optimization problems
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- An accelerated proximal algorithm for the difference of convex programming
- Difference of convex solution of quadratically constrained optimization problems.
- On solving a d.c. programming problem by a sequence of linear programs
Cites work
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 46303 (Why is no real title available?)
- A DC optimization-based clustering technique for edge detection
- A DC programming approach for feature selection in support vector machines learning
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Accelerating the DC algorithm for smooth functions
- An inertial algorithm for DC programming
- Binary classification via spherical separator by DC programming and DCA
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Classification in the multiple instance learning framework via spherical separation
- Computing B-stationary points of nonsmooth DC programs
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Duality in nonconvex optimization
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Necessary conditions for local optimality in difference-of-convex programming
- Newton-Type Methods for Optimization and Variational Problems
- Newton-type methods: a broader view
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Optimizing sensor cover energy via DC programming
- Proximal bundle methods for nonsmooth DC programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
Cited in
(9)- Convergence analysis of difference-of-convex algorithm with subanalytic data
- scientific article; zbMATH DE number 929729 (Why is no real title available?)
- The ABC of DC programming
- Alternating DC algorithm for partial DC programming problems
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Sequential greedy approximation for certain convex optimization problems
- Strengthening the sequential convex MINLP technique by perspective reformulations
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- An augmented subgradient method for minimizing nonsmooth DC functions
This page was built for publication: Sequential difference-of-convex programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2198538)
