An efficient solution method for rank two quasiconcave minimization problems
From MaRDI portal
Recommendations
- A quasiconcave minimization method for solving linear two-level programs
- A parametric solution algorithm for a class of rank-two nonconvex programs
- A new solution method for a class of large dimension rank-two nonconvex programs
- A rank-two feasible direction algorithm for the binary quadratic programming
- A note on approximating quadratic programming with rank constraint
- Publication:4955984
- An efficient algorithm for globally minimizing sum of quadratic ratios problem with nonconvex quadratic constraints
- A quasi-Newton method with rank-two update to solve interval optimization problems
- An approximation theory of matrix rank minimization and its application to quadratic equations
- A class of rank-two ellipsoid algorithms for convex programming
Cites work
- Convex Analysis
- scientific article; zbMATH DE number 3761779 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
Cited in
(21)- The complementary convex structure in global optimization
- A global optimization approach for solving the convex multiplicative programming problem
- Strongly polynomial time algorithms for certain concave minimization problems on networks
- Linear programs with an additional rank two reverse convex constraint
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A vector linear programming approach for certain global optimization problems
- The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs
- Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions
- A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
- Underestimation functions for a rank-two partitioning method
- \(NP\)-hardness of linear multiplicative programming and related problems
- Level set algorithm for solving convex multiplicative programming problems
- Minimizing the sum of a convex function and a specially structured nonconvex function
- Strongly polynomial algorithm for a production-transportation problem with concave production cost
- Two-point mid-range approximation enhanced recursive quadratic programming method
- A parametric solution algorithm for a class of rank-two nonconvex programs
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- A PRACTICAL ALOGORITHM FOR MINIMIZING A RANK-TWO SADDLE FUNCTION ON A POLYTOPE
- A method based on parametric convex programming for solving convex multiplicative programming problem
This page was built for publication: An efficient solution method for rank two quasiconcave minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4327903)
