New Farkas-Type Constraint Qualifications in Convex Infinite Programming

ESAIM - Control, Optimisation and Calculus of Variations - France
doi 10.1051/cocv:2007027
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EDP Sciences

Related search

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

The Journal of the Australian Mathematical Society. Series B. Applied Mathematics
1999English

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

Duality Theorems for Convex Programming Without Constraint Qualification

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

On Duality Theory of Convex Semi-Infinite Programming

Optimization
ControlManagement ScienceApplied MathematicsOptimizationOperations Research
2005English

Newton-Type Methods for Optimization Problems Without Constraint Qualifications

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2004English

Farkas-Type Results for General Composed Convex Optimization Problems With Inequality Constraints

Mathematical Inequalities and Applications
MathematicsApplied Mathematics
2010English

Constraint Logic Programming for Non Convex NLP and MINLP Problems

IFAC Proceedings Volumes
2006English

Implementing Type Theory in Higher Order Constraint Logic Programming

Mathematical Structures in Computer Science
MathematicsComputer Science Applications
2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy