Pages that link to "Item:Q384210"
From MaRDI portal
The following pages link to A cone constrained convex program: structure and algorithms (Q384210):
Displaying 12 items.
- A linear mixed integer programming model for \(N\)-vehicle exploration problem (Q259122) (← links)
- A tensor analogy of Yuan's theorem of the alternative and polynomial optimization with sign structure (Q274079) (← links)
- Cross-Hill: a heuristic method for global optimization (Q669439) (← links)
- Space tensor conic programming (Q742309) (← links)
- A conical algorithm for solving a class of complementarity problems (Q1089269) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- A maximal volume cone algorithm for linear programming problems (Q1277217) (← links)
- Conical algorithm for the global minimization of linearly constrained decomposable concave minimization problems (Q1321233) (← links)
- A cone programming approach to the bilinear matrix inequality problem and its geometry (Q1373737) (← links)
- Cone adaptation strategies for a finite and exact cutting plane algorithm for concave minimization (Q1862178) (← links)
- Cone-constrained eigenvalue problems: Theory and algorithms (Q2268921) (← links)
- The strong conical hull intersection property for convex programming (Q2490330) (← links)
