Pages that link to "Item:Q5000468"

The following pages link to A new solution method for a class of large dimension rank-two nonconvex programs (Q5000468):

Displaying 11 items.

• A parametric solution algorithm for a class of rank-two nonconvex programs (Q475801) (← links)
• Underestimation functions for a rank-two partitioning method (Q2026521) (← links)
• Global algorithm for a class of multiplicative programs using piecewise linear approximation technique (Q2679815) (← links)
• An efficient solution method for rank two quasiconcave minimization problems (Q4327903) (← links)
• An accelerating outer space algorithm for globally solving generalized linear multiplicative problems (Q6093979) (← links)
• Globally minimizing a class of linear multiplicative forms via simplicial branch-and-bound (Q6162508) (← links)
• An efficient global optimization algorithm for a class of linear multiplicative problems based on convex relaxation (Q6552696) (← links)
• Rank-two programs involving linear fractional functions (Q6581918) (← links)
• An efficient branch-and-bound algorithm using an adaptive branching rule with quadratic convex relaxation for globally solving general linear multiplicative programs (Q6581973) (← links)
• An efficient image space branch-reduction-bound algorithm to globally solve generalized fractional programming problems for large-scale real applications (Q6582024) (← links)
• A novel branch-and-bound algorithm for solving linear multiplicative programming problems (Q6646071) (← links)