On minimization subject to cone constraints

DOI10.1080/01630568308816172zbMath0543.49008OpenAlexW2153859623MaRDI QIDQ3331805

Sanjo Zlobec, B. M. Glover, Bruce D.Craven

Publication date: 1983

Published in: Numerical Functional Analysis and Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/01630568308816172

zbMATH Keywords

state constraintsKuhn-Tucker conditionlexicographic optimizationpseudo-convexityweak-minimum without constraint qualification

Mathematics Subject Classification ID

Nonlinear programming (90C30) Normed linear spaces and Banach spaces; Banach lattices (46B99) Semi-infinite programming (90C34) Convex sets in topological vector spaces (aspects of convex geometry) (52A07) Optimality conditions for problems involving ordinary differential equations (49K15) Optimality conditions for problems in abstract spaces (49K27)

Related Items

Characterizing optimality in mathematical programming models, Solvability results for sublinear functions and operators, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Generalized convexity in nondifferentiable programming

Cites Work

• Nonlinear programming in locally convex spaces
• Stabilization and determination of the set of minimal binding constraints in convex programming¹
• Complete characterization of optimality for convex programming in banach spaces^†
• Characterizations of optimality without constraint qualification for the abstract convex program
• Lagrangean conditions and quasiduality
• Convex Analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item