Pages that link to "Item:Q686993"

The following pages link to An outer approximation method for minimizing the product of several convex functions on a convex set (Q686993):

Displaying 26 items.

• A FPTAS for a class of linear multiplicative problems (Q849090) (← links)
• An outcome-space finite algorithm for solving linear multiplicative programming (Q849749) (← links)
• Linearization method for a class of multiplicative programming with exponent (Q864775) (← links)
• A convex analysis approach for convex multiplicative programming (Q934807) (← links)
• An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
• A new global optimization approach for convex multiplicative programming (Q972168) (← links)
• A nonisolated optimal solution of general linear multiplicative programming problems (Q1010262) (← links)
• Solving the sum-of-ratios problem by a stochastic search algorithm (Q1024829) (← links)
• A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems (Q1321648) (← links)
• Convex programs with an additional constraint on the product of several convex functions (Q1333464) (← links)
• Multiplicative programming problems: Analysis and efficient point search heuristic (Q1367730) (← links)
• A global optimization approach for solving generalized nonlinear multiplicative programming problem (Q1724645) (← links)
• A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← 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)
• Global optimization method for linear multiplicative programming (Q2355349) (← links)
• A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming (Q2375741) (← links)
• A method of acceleration for a class of multiplicative programming problems with exponent (Q2378273) (← links)
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems (Q2479840) (← links)
• Level set algorithm for solving convex multiplicative programming problems (Q2570801) (← links)
• Solving generalized convex multiobjective programming problems by a normal direction method (Q2836102) (← links)
• On jet-convex functions and their tensor products (Q2903151) (← links)
• An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems (Q2942454) (← links)
• (Q4266762) (← links)
• An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming (Q6099489) (← links)