Pages that link to "Item:Q2860243"

The following pages link to A geometric method for a class of convex programs (Q2860243):

Displaying 10 items.

• A geometric approach for convexity in some variational problem in the Gauss space (Q361740) (← links)
• A tutorial on geometric programming (Q1027158) (← links)
• A cone programming approach to the bilinear matrix inequality problem and its geometry (Q1373737) (← links)
• Complexity of convex optimization using geometry-based measures and a reference point (Q1434069) (← links)
• A new two-level linear relaxed bound method for geometric programming problems (Q1774846) (← links)
• Conic programming: infeasibility certificates and projective geometry (Q1996078) (← links)
• A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
• Geometrical interpretation of the predictor-corrector type algorithms in structured optimization problems (Q3426228) (← links)
• Un algoritmo de programacion geometrica basado en funciones penalidad-multiplicadoras (Q3809594) (← links)
• The geometry of conservative programs (Q4961721) (← links)