Feasible direction methods in the absence of slater's condition: Mathematische Operationsforschung und Statistik. Series Optimization: Vol 9, No 2

Views

CrossRef citations to date

Altmetric

Abstract

Three popular feasible direction methods for solving convex programming problems are reformulated so that they now work in the absence of Slater’s condition or any other constraint qualification.

¹Research partly supported by the National Research Council of Canada.

Notes

¹Research partly supported by the National Research Council of Canada.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

Feasible direction methods in the absence of slater's condition

Information for

Open access

Opportunities

Help and information

Feasible direction methods in the absence of slater's condition

Abstract

Notes

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date

Your download is now in progress and you may close this window

Login or register to access this feature