Modified regularity conditions for nonlinear programming problems over mixed cone domains
From MaRDI portal
Publication:4055388
DOI10.1007/BF01580234zbMath0301.90035MaRDI QIDQ4055388
No author found.
Publication date: 1974
Published in: Mathematical Programming (Search for Journal in Brave)
Related Items (2)
Quadratic duality over convex cone domains ⋮ On a sufficient optimality condition over convex feasible regions
Cites Work
- Unnamed Item
- A generalization of the Alaoglu-Bourbaki theorem and its applications
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- A duality theory for abstract mathematical programs with applications to optimal control theory
- Note on linear fractional functionals programming
- A duality theorem for complex quadratic programming
- Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Programmes in Paired Spaces
- Quadratic duality over convex cone domains
- Geometry of optimality conditions and constraint qualifications
- Programming with linear fractional functionals
- Constraint qualifications in maximization problems
- Constrained Minimization Problems in Finite-Dimensional Spaces
- Nonlinear Programming in Banach Space
- Duality in fractional and indefinite programming
- Duality and asymptotic solvability over cones
- Convex Analysis
- A Necessary and Sufficient Qualification for Constrained Optimization
- Saddle-Point Optimality Criteria of Nonlinear Programming Problems over Cones without Differentiability
- A Note on Farkas Lemmas over Cone Domains
- Linear inequalities, mathematical programming and matrix theory
- A Simplification of the Hartree-Fock Method
This page was built for publication: Modified regularity conditions for nonlinear programming problems over mixed cone domains
