Characterization of optimality in convex programming without a constraint qualification

DOI10.1007/BF00933129zbMath0327.90025OpenAlexW1992605103MaRDI QIDQ1226443

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

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1007/bf00933129

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

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

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