Constraint Qualifications for Extended Farkas's Lemmas and Lagrangian Dualities in Convex Infinite Programming.
D. H. FangC. LiKung Fu NgPublished in: SIAM J. Optim. (2009)
Keyphrases
- constrained minimization
- dual variables
- inequality constraints
- optimal solution
- programming language
- saddle point
- temporal planning problems
- convex constraints
- piecewise linear
- programming course
- infinite dimensional
- theorem prover
- convex optimization
- linear programming
- quadratically constrained quadratic
- nonlinear programming problems
- genetic algorithm
- constrained optimization
- development environment
- computer programming
- lagrangian relaxation
- interior point methods
- theorem proving
- software engineering