scientific article; zbMATH DE number 3850834

zbMATH Open0535.90075MaRDI QIDQ3320135FDOQ3320135

Authors: Jonathan M. Borwein, Henry Wolkowicz 

Publication date: 1981

Title of this publication is not available (Why is that?)

Recommendations

• Complete characterizations of stable Farkas' lemma and cone-convex programming duality
• scientific article; zbMATH DE number 3906245
• A simple constraint qualification in convex programming
• New Farkas-type constraint qualifications in convex infinite programming
• Stability of linearly constrained convex quadratic programs

zbMATH Keywords

sensitivity theoremcone-convex programminggeneralization of Farkas' Lemmastrengthened optimality conditions

Mathematics Subject Classification ID

Methods of successive quadratic programming type (90C55) Programming involving graphs or networks (90C35) Convexity of real functions of several variables, generalizations (26B25)

Cited In (3)

• Some applications of optimization in matrix theory
• A cone constrained convex program: structure and algorithms
• Characterization of stability for cone increasing constraint mappings

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