Sequential difference-of-convex programming
From MaRDI portal
Publication:2198538
DOI10.1007/S10957-020-01721-XzbMATH Open1450.90033OpenAlexW3047532160MaRDI QIDQ2198538FDOQ2198538
Authors: Welington de Oliveira 
Publication date: 10 September 2020
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-020-01721-x
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
Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52) Set-valued and variational analysis (49J53)
Cites Work
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Duality in nonconvex optimization
- Newton-Type Methods for Optimization and Variational Problems
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Binary classification via spherical separator by DC programming and DCA
- A DC programming approach for feature selection in support vector machines learning
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Necessary conditions for local optimality in difference-of-convex programming
- Convex analysis and global optimization
- A DC optimization-based clustering technique for edge detection
- Minimizing Piecewise-Concave Functions Over Polyhedra
- Computing B-stationary points of nonsmooth DC programs
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- DC programming and DCA: thirty years of developments
- Accelerating the DC algorithm for smooth functions
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- Using positive spanning sets to achieve d-stationarity with the boosted DC algorithm
- Proximal bundle methods for nonsmooth DC programming
- An inertial algorithm for DC programming
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- Double bundle method for finding Clarke stationary points in nonsmooth DC programming
- Classification in the multiple instance learning framework via spherical separation
- Newton-type methods: a broader view
- Optimizing sensor cover energy via DC programming
Cited In (9)
- The ABC of DC programming
- Sequential greedy approximation for certain convex optimization problems
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- Title not available (Why is that?)
- An augmented subgradient method for minimizing nonsmooth DC functions
- Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
- Alternating DC algorithm for partial DC programming problems
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- Strengthening the sequential convex MINLP technique by perspective reformulations
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)
