Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
From MaRDI portal
Publication:5503697
DOI10.1080/10556780802263990zbMath1151.90508OpenAlexW1987228767MaRDI QIDQ5503697
Hoai An Le Thi, Tao Pham Dinh, F. Akoa
Publication date: 16 January 2009
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780802263990
nonconvex quadratic programmingquasidefinite matrixmerit functioninterior pointDC programmingexact penaltyDC regularizationDCA (DC algorithms)
Nonconvex programming, global optimization (90C26) Quadratic programming (90C20) Interior-point methods (90C51)
Related Items
Variations and extension of the convex-concave procedure, New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming, Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model, A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks, DC Programming Approaches for BMI and QMI Feasibility Problems, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, The boosted DC algorithm for linearly constrained DC programming, An efficient DC programming approach for portfolio decision with higher moments, Convergence of the projection and contraction methods for solving bilevel variational inequality problems, Properties of two DC algorithms in quadratic programming, On a solution method in indefinite quadratic programming under linear constraints, Exact penalty and error bounds in DC programming, A DC programming approach for solving the symmetric eigenvalue complementarity problem, Progress in shakedown analysis with applications to composites, A branch-and-bound algorithm embedded with DCA for DC programming, Linear convergence of a type of iterative sequences in nonconvex quadratic programming, Convergence analysis of difference-of-convex algorithm with subanalytic data, One step from DC optimization to DC mixed variational inequalities, DC programming and DCA: thirty years of developments, Boundedness of a type of iterative sequences in two-dimensional quadratic programming, A branch and reduce approach for solving a class of low rank d.c. programs, Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
Uses Software
