Convergence analysis of difference-of-convex algorithm with subanalytic data
From MaRDI portal
Publication:1730802
DOI10.1007/s10957-018-1345-yzbMath1409.90187OpenAlexW2884955443WikidataQ129458320 ScholiaQ129458320MaRDI QIDQ1730802
Hoai An Le Thi, Tao Pham Dinh, 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
subdifferentialconvergence rateLojasiewicz 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)
Related Items
Alternating DC algorithm for partial DC programming problems, Solving a continuous multifacility location problem by DC algorithms, DC semidefinite programming and cone constrained DC optimization. I: Theory, Composite Difference-Max Programs for Modern Statistical Estimation Problems, Some brief observations in minimizing the sum of locally Lipschitzian functions, New Bregman proximal type algoritms for solving DC optimization problems, The boosted DC algorithm for linearly constrained DC programming, On solving difference of convex functions programs with linear complementarity constraints, On a solution method in indefinite quadratic programming under linear constraints, Open issues and recent advances in DC programming and DCA, 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, Unnamed Item, DC programming and DCA for enhancing physical layer security via relay beamforming strategies, DC programming and DCA: thirty years of developments, Proximal Distance Algorithms: Theory and Examples, The Boosted Difference of Convex Functions Algorithm for Nonsmooth Functions, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems, Encoding inductive invariants as barrier certificates: synthesis via difference-of-convex programming, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Behavior of DCA sequences for solving the trust-region subproblem
- On the convergence of the proximal algorithm for nonsmooth functions involving analytic features
- Error bounds for systems of lower semicontinuous functions in Asplund spaces
- Semianalytic and subanalytic sets
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- On semi- and subanalytic geometry
- Difference of convex functions optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Geometry of subanalytic and semialgebraic sets
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- 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
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Convergence rate of the Pham Dinh-Le Thi algorithm for the trust-region subproblem
- 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
- Variational Analysis
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- LOQO:an interior point code for quadratic programming
- Trust Region Methods
- Proximal Decomposition on the Graph of a Maximal Monotone Operator
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Convergence of the Iterates of Descent Methods for Analytic Cost Functions
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex Analysis
- Sur le problème de la division
