Pages that link to "Item:Q987514"

The following pages link to Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint (Q987514):

Displaying 10 items.

• On optimization over the efficient set of a multiple objective linear programming problem (Q511973) (← links)
• An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993) (← links)
• An algorithm for solving convex programs with an additional convex- concave constraint (Q689151) (← links)
• A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints (Q945281) (← links)
• Branch-and-reduce algorithm for convex programs with additional multiplicative constraints (Q1042085) (← links)
• Time-optimal velocity planning by a bound-tightening technique (Q1753068) (← links)
• Separable concave minimization via partial outer approximation and branch and bound (Q2277369) (← links)
• A rectangular branch and bound reduction algorithm for solving a kind of multi-product-sum programming problem (Q2924147) (← links)
• Reducing Separable Convex Programs with Tree Constraints (Q3351145) (← links)
• (Q5462190) (← links)