A geometric method for a class of convex programs

MaRDI QIDQ2860243zbMATH OpenFDO

Authors Shenggui Zhang, Xiaoyan Chen

Publication date 19 November 2013

Published in Journal of Fujian Normal University. Natural Science (Search for Journal in Brave)

zbMATH Keywords

distanceconvex programminglinear manifold

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• A generalized variable metric projection algorithm for geometric programming
• Frank-Wolfe algorithm to a certain kind of geometric programming
• scientific article; zbMATH DE number 1046987
• Iterative linear programming solution of convex programs
• A Parallel Algorithm for a Class of Convex Programs

Cited in

(10)

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

This page was built for publication: A geometric method for a class of convex programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2860243)