Geometry of optimality conditions and constraint qualifications
From MaRDI portal
Publication:4777073
DOI10.1007/BF01584534zbMATH Open0288.90068OpenAlexW2062988270MaRDI QIDQ4777073FDOQ4777073
Authors: F. J. Gould, Jon W. Tolle 
Publication date: 1972
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01584534
Cites Work
- Title not available (Why is that?)
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generalized Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- Nonlinear Programming in Banach Space
- Title not available (Why is that?)
- Constraint qualifications in maximization problems
- A Necessary and Sufficient Qualification for Constrained Optimization
- Title not available (Why is that?)
- Optimality conditions and constraint qualifications in Banach space
- Optimization theory in linear spaces. III: Mathematical programming in partially ordered Banach spaces
- Asymptotic Kuhn–Tucker Conditions for Mathematical Programming Problems in a Banach Space
- On constraint qualifications in nonlinear programming
- Title not available (Why is that?)
- Constrained Minimization Problems in Finite-Dimensional Spaces
Cited In (22)
- On functions whose stationary points are global minima
- A new constraint qualification condition
- Duality for nonlinear multiple-criteria optimization problems
- Modified regularity conditions for nonlinear programming problems over mixed cone domains
- Optimierungsprobleme mit nichtlinearen Gleichungsrestriktionen
- On constraint qualifications in nonsmooth optimization.
- Approximation operators in optimization theory
- Derivative-free methods for mixed-integer nonsmooth constrained optimization
- Optimality condition: Constraint regularization
- A strengthened test for optimality
- Necessary and sufficient conditions for regularity of constraints in convex programming
- A constraint qualification for convex programming
- The relation between pseudonormality and quasiregularity in constrained optimization
- Regularizing the abstract convex program
- Method of reduction in convex programming
- Characterizing FJ and KKT conditions in nonconvex mathematical programming with applications
- Characterization of optimality in convex programming without a constraint qualification
- Various definitions of the derivative in mathematical programming
- Title not available (Why is that?)
- Characterization of generalized FJ and KKT conditions in nonsmooth nonconvex optimization
- Geometry of optimality conditions and constraint qualifications: The convex case
- Pseudonormality and a Lagrange multiplier theory for constrained optimization
This page was built for publication: Geometry of optimality conditions and constraint qualifications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4777073)
