DC Programming Approaches for BMI and QMI Feasibility Problems
From MaRDI portal
Publication:3192953
DOI10.1007/978-3-319-06569-4_3zbMath1327.90242OpenAlexW86890725MaRDI QIDQ3192953
Publication date: 14 October 2015
Published in: Advanced Computational Methods for Knowledge Engineering (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-06569-4_3
Related Items
Variations and extension of the convex-concave procedure ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program ⋮ On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint ⋮ Improved dc programming approaches for solving the quadratic eigenvalue complementarity problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient DC programming approach for portfolio decision with higher moments
- A new reformulation-linearization technique for bilinear programming problems
- Primal-relaxed dual global optimization approach
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- A cone programming approach to the bilinear matrix inequality problem and its geometry
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Exact penalty in d. c. programming
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Global optimization for the biaffine matrix inequality problem
- DC programming: overview.
- DC optimization approach to robust controls: the optimal scaling value problem
- Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
- A DC Programming Approach for Mixed-Integer Linear Programs
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
- CSDP, A C library for semidefinite programming
- Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
- Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming
- Convex Analysis
- Introduction to global optimization.
- Branch-and-cut algorithms for the bilinear matrix inequality eigenvalue problem
