An effective generalization of the direct support method in quadratic convex programming

zbMATH Open1275.90052MaRDI QIDQ2908321FDOQ2908321

Authors: Sonia Radjef, Mohand Ouamer Bibi 

Publication date: 4 September 2012

Published in: Applied Mathematical Sciences (Ruse) (Search for Journal in Brave)

Full work available at URL: http://www.m-hikari.com/ams/ams-2012/ams-29-32-2012/index.html

Recommendations

• Dual support method for solving convex quadratic programs
• Minimization of a convex quadratic function with two-sided constraints for variables
• Publication:3479824
• Solving the general quadratic programming problem in a finite number of steps
• scientific article; zbMATH DE number 3922383

zbMATH Keywords

convex quadratic programsuboptimalitydirect support method

Mathematics Subject Classification ID

Quadratic programming (90C20) Convex programming (90C25)

Cited In (5)

• Title not available (Why is that?)
• Adaptive global algorithm for solving box-constrained non-convex quadratic minimization problems
• An effective generalization of the direct support method
• Dual support method for solving convex quadratic programs
• Primal-dual method for solving a linear-quadratic multi-input optimal control problem

This page was built for publication: An effective generalization of the direct support method in quadratic convex programming

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