A new solution method for a class of large dimension rank-two nonconvex programs
From MaRDI portal
(Redirected from Publication:5000468)
Cited in
(13)- Underestimation functions for a rank-two partitioning method
- Global algorithm for a class of multiplicative programs using piecewise linear approximation technique
- An efficient solution method for rank two quasiconcave minimization problems
- A parametric solution algorithm for a class of rank-two nonconvex programs
- An accelerating outer space algorithm for globally solving generalized linear multiplicative problems
- Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound
- An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation
- Rank-two programs involving linear fractional functions
- An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs
- An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications
- A novel branch-and-bound algorithm for solving linear multiplicative programming problems
- A new branch and bound method for solving linear multiplicative programming problems
- A spatial global optimization algorithm for generalized fractional programming problems using second-order cone relaxation
This page was built for publication: A new solution method for a class of large dimension rank-two nonconvex programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5000468)
