Pages that link to "Item:Q934807"
From MaRDI portal
The following pages link to A convex analysis approach for convex multiplicative programming (Q934807):
Displaying 20 items.
- Theoretical and computational results about optimality-based domain reductions (Q288410) (← links)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms (Q607786) (← links)
- On the solution of generalized multiplicative extremum problems (Q635793) (← links)
- Generating efficient outcome points for convex multiobjective programming problems and its application to convex multiplicative programming (Q642767) (← links)
- A branch-and-cut algorithm for a class of sum-of-ratios problems (Q668157) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- A new global optimization approach for convex multiplicative programming (Q972168) (← links)
- A global optimization approach for solving the convex multiplicative programming problem (Q1200524) (← links)
- A parametric successive underestimation method for convex multiplicative programming problems (Q1200637) (← links)
- Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
- Generalized convex multiplicative programming via quasiconcave minimization (Q1359123) (← links)
- Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
- Minimizing the product of two discrete convex functions (Q1376689) (← links)
- An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming (Q1567067) (← links)
- Solving a class of multiplicative programming problems via \(C\)- programming (Q1892609) (← links)
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs (Q2027064) (← links)
- An objective space cut and bound algorithm for convex multiplicative programmes (Q2250114) (← links)
- Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
- (Q3694101) (← links)
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems (Q6102175) (← links)
