scientific article; zbMATH DE number 4045481

MaRDI QIDQ3783074zbMATH OpenFDO

Authors C. M. Shetty, Mohammed Ben-Daya

Publication date 1988

zbMATH Keywords

convex quadratic programsmaster problemsubproblem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Recommendations

• A decomposition method for quadratic programming
• A numerically stable dual method for solving strictly convex quadratic programs
• scientific article; zbMATH DE number 1190656
• A decomposition algorithm for solving large-scale quadratic programming problems
• scientific article; zbMATH DE number 1341943

Cited in

(19)

• Optimality tests for partitioning and sectional search algorithms
• On affine scaling algorithms for nonconvex quadratic programming
• Resolving degeneracy in quadratic programming
• An O(n^ 3 L) primal-dual potential reduction algorithm for solving convex quadratic programs
• Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
• Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions
• On the convergence of the method of analytic centers when applied to convex quadratic programs
• A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs
• A decomposition algorithm for solving large-scale quadratic programming problems
• Decomposition-aggregation method for convex programming problems
• scientific article; zbMATH DE number 1375371 (Why is no real title available?)
• scientific article; zbMATH DE number 1190656 (Why is no real title available?)
• A variable dimension algorithm with the Dantzig-Wolfe decomposition for structured stationary point problems
• A decomposition method for quadratic programming
• scientific article; zbMATH DE number 6027005 (Why is no real title available?)
• A graph-based decomposition method for convex quadratic optimization with indicators
• A long-step barrier method for convex quadratic programming
• An \(O(n^ 3L)\) potential reduction algorithm for linear programming
• An approximate decomposition algorithm for convex minimization

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 Q3783074)