Convergence analysis of difference-of-convex algorithm with subanalytic data
From MaRDI portal
Recommendations
- Sequential difference-of-convex programming
- Convergence rate analysis of the proximal difference of the convex algorithm
- Convergence analysis of a proximal point algorithm for minimizing differences of functions
- Global convergence of a proximal linearized algorithm for difference of convex functions
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
Cites work
- scientific article; zbMATH DE number 429516 (Why is no real title available?)
- scientific article; zbMATH DE number 3371284 (Why is no real title available?)
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Behavior of DCA sequences for solving the trust-region subproblem
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- Convex Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Geometry of subanalytic and semialgebraic sets
- LOQO:an interior point code for quadratic programming
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- On semi- and subanalytic geometry
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Semianalytic and subanalytic sets
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Sur le problème de la division
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Trust Region Methods
- Variational Analysis
Cited in
(23)- Composite difference-MAX programs for modern statistical estimation problems
- On solving difference of convex functions programs with linear complementarity constraints
- DC programming and DCA: thirty years of developments
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- Proximal distance algorithms: theory and practice
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- New Bregman proximal type algoritms for solving DC optimization problems
- Open issues and recent advances in DC programming and DCA
- scientific article; zbMATH DE number 7811224 (Why is no real title available?)
- Alternating DC algorithm for partial DC programming problems
- Regularized distributionally robust optimization with application to the index tracking problem
- Sequential difference-of-convex programming
- Solving a continuous multifacility location problem by DC algorithms
- On a solution method in indefinite quadratic programming under linear constraints
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- The boosted DC algorithm for linearly constrained DC programming
- A convergence analysis for a convex version of Dikin's algorithm
- An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies
This page was built for publication: Convergence analysis of difference-of-convex algorithm with subanalytic data
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1730802)
