Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
DOI10.1080/10556780802263990zbMATH Open1151.90508OpenAlexW1987228767MaRDI QIDQ5503697FDOQ5503697
Authors: Pham Dinh Tao, Le Thi Hoai An, F. Akoa 
Publication date: 16 January 2009
Published in: Optimization Methods \& Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780802263990
Recommendations
- An interior point method for general large-scale quadratic programming problems
- On affine scaling algorithms for nonconvex quadratic programming
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Interior-point algorithms for global optimization
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
interior pointmerit functionnonconvex quadratic programmingDC programmingexact penaltyquasidefinite matrixDC regularizationDCA (DC algorithms)
Quadratic programming (90C20) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Cited In (22)
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- An efficient DC programming approach for portfolio decision with higher moments
- Variations and extension of the convex-concave procedure
- DC programming and DCA: thirty years of developments
- One step from DC optimization to DC mixed variational inequalities
- A branch and reduce approach for solving a class of low rank d.c. programs
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
- Properties of two DC algorithms in quadratic programming
- Boundedness of a type of iterative sequences in two-dimensional quadratic programming
- A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- Linear convergence of a type of iterative sequences in nonconvex quadratic programming
- A branch-and-bound algorithm embedded with DCA for DC programming
- On a solution method in indefinite quadratic programming under linear constraints
- DC Programming Approaches for BMI and QMI Feasibility Problems
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Progress in shakedown analysis with applications to composites
- Convergence of the projection and contraction methods for solving bilevel variational inequality problems
- The boosted DC algorithm for linearly constrained DC programming
Uses Software
This page was built for publication: Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5503697)
