A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming Revisited

The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
doi 10.1017/s033427000001095x
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

New Farkas-Type Constraint Qualifications in Convex Infinite Programming

ESAIM - Control, Optimisation and Calculus of Variations
ControlComputational MathematicsOptimizationSystems Engineering
2007English

Necessary and Sufficient Constraint Qualifications for Solvability of Systems of Infinite Convex Inequalities

Nonlinear Analysis, Theory, Methods and Applications
Applied MathematicsAnalysis
2008English

Constraint Qualifications

2005English

On Duality Theory of Convex Semi-Infinite Programming

Optimization
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2005English

Duality Theorems for Convex Programming Without Constraint Qualification

Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics
1984English

Constraint Aggregation in Infinite-Dimensional Spaces and Applications

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2001English

Constraint Logic Programming for Non Convex NLP and MINLP Problems

IFAC Proceedings Volumes
2006English

Constraint Games Revisited

2017English

Monadic Constraint Programming

Journal of Functional Programming
Software
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy