Convergence analysis of difference-of-convex algorithm with subanalytic data
From MaRDI portal
Publication:1730802
DOI10.1007/S10957-018-1345-YzbMATH Open1409.90187OpenAlexW2884955443WikidataQ129458320 ScholiaQ129458320MaRDI QIDQ1730802FDOQ1730802
Authors: Le Thi Hoai An, Pham Dinh Tao, van Ngai Huynh 
Publication date: 6 March 2019
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-018-1345-y
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
convergence ratesubdifferentialLojasiewicz exponentsubanalyticitydifference-of-convex programmingdifference-of-convex algorithm
Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)
Cites Work
- LOQO:an interior point code for quadratic programming
- Variational Analysis
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Convex Analysis
- Semianalytic and subanalytic sets
- Trust Region Methods
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- On semi- and subanalytic geometry
- Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward-backward splitting, and regularized Gauss-Seidel methods
- Title not available (Why is that?)
- Sur le problème de la division
- Geometry of subanalytic and semialgebraic sets
- 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
- Title not available (Why is that?)
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- Behavior of DCA sequences for solving the trust-region subproblem
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Convergence of Pham Dinh-Le Thi's algorithm for the trust-region subproblem
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems
- DC programming and DCA: thirty years of developments
Cited In (23)
- Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming
- New Bregman proximal type algoritms for solving DC optimization problems
- Regularized distributionally robust optimization with application to the index tracking problem
- Composite difference-MAX programs for modern statistical estimation problems
- DC programming and DCA: thirty years of developments
- On solving difference of convex functions programs with linear complementarity constraints
- On the rate of convergence of the difference-of-convex algorithm (DCA)
- A convergence analysis for a convex version of Dikin's algorithm
- Sequential difference-of-convex programming
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Title not available (Why is that?)
- Proximal distance algorithms: theory and practice
- On a solution method in indefinite quadratic programming under linear constraints
- DC programming and DCA for enhancing physical layer security via relay beamforming strategies
- Open issues and recent advances in DC programming and DCA
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- Some brief observations in minimizing the sum of locally Lipschitzian functions
- Solving a continuous multifacility location problem by DC algorithms
- Alternating DC algorithm for partial DC programming problems
- An inertial proximal point method for difference of maximal monotone vector fields in Hadamard manifolds
- Error bound and isocost imply linear convergence of DCA-based algorithms to D-stationarity
- The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions
- The boosted DC algorithm for linearly constrained DC programming
Uses Software
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)
