scientific article; zbMATH DE number 1497369

MaRDI QIDQ4499054zbMATH OpenFDO

Authors Minhong Zhang, Dezhuang Yang, Qingzhi Yang

Publication date 6 May 2001

zbMATH Keywords

basic standard hyperplanebasic standard linecutting hyperplane

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 94024
• scientific article; zbMATH DE number 4037611
• scientific article; zbMATH DE number 3849959
• scientific article; zbMATH DE number 4070639
• The problem of convex programming with linear constraints

Cited in

(10)

• A forward convex-simplex method
• An adaptive incremental approach for the solution of convex programming models
• A new algorithm for minimizing convex functions over convex sets
• An algorithm for maximizing a convex function over a simple set
• Note: An algorithm to solve polyhedral convex set optimization problems
• scientific article; zbMATH DE number 3849959 (Why is no real title available?)
• The complexity of a special convex programming problem connected with nonlinear optimization
• scientific article; zbMATH DE number 175989 (Why is no real title available?)
• scientific article; zbMATH DE number 6263278 (Why is no real title available?)
• Convex programming algorithm with a modified Lagrange function

This page was built for publication:

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