Characterization of optimality in convex programming without a constraint qualification

DOI10.1007/BF00933129zbMath0327.90025MaRDI QIDQ1226443

Adi Ben-Israel, Sanjo Zlobec, Aharon Ben-Tal

Publication date: 1976

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Mathematics Subject Classification ID

90C25: Convex programming

Related Items

A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Second-order and related extremality conditions in nonlinear programming, A note on multiple optimality conditions for programs with convex inequality constraints, On efficient sets in vector maximum problems - A brief survey, Regularizing the abstract convex program, Method of reduction in convex programming, A simplified test for optimality, Calculating the cone of directions of constancy, Projection and restriction methods in geometric programming and related problems, Characterizations of optimality in convex programming: the nondifferentiable case, Primal and dual optimality criteria in convex programming, Unnamed Item, Generalized convexity in nondifferentiable programming, Geometry of optimality conditions and constraint qualifications: The convex case, Complete characterization of optimality for convex programming in banach spaces^†, On optimality in abstract convex programming, On A characterization of optimality in convex programming, Characterizations of optimality in convex programming: the nondifferentiable case

Cites Work

• Unnamed Item
• Unnamed Item
• Coincidence properties of birth and death processes
• Lectures on mathematical theory of extremum problems. Translated from the Russian by D. Louvish
• Geometry of optimality conditions and constraint qualifications
• Constraint qualifications in maximization problems
• Seven Kinds of Convexity
• Asymptotic Lagrange Regularity for Pseudoconcave Programming with Weak Constraint Qualification
• Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
• A Necessary and Sufficient Qualification for Constrained Optimization
• Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
• Constraint Qualifications Revisited