A simple constraint qualification in infinite dimensional programming

DOI10.1007/BF01589443zbMATH Open0597.90056OpenAlexW1999138341WikidataQ56935986 ScholiaQ56935986MaRDI QIDQ3731366FDOQ3731366

Henry Wolkowicz, Jonathan M. Borwein

Publication date: 1986

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01589443

Recommendations

• Constraint qualification with Schauder basis for infinite programming problems
• A Comparison of Constraint Qualifications in Infinite-Dimensional Convex Programming
• A comparison of constraint qualifications in infinite-dimensional convex programming revisited
• Constraint qualifications and Farkas lemma in convex infinite programming
• scientific article; zbMATH DE number 2158983
• A simple constraint qualification in convex programming
• Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming
• Constraint qualifications in linear vector semi-infinite optimization
• New Farkas-type constraint qualifications in convex infinite programming
• Necessary and sufficient conditions for qualitative properties of infinite dimensional linear programming problems

zbMATH Keywords

Slater's conditionduality theoremsequality constraintsinfinite dimensional linear programming\(L_ 2\)- approximationconstant qualification

Mathematics Subject Classification ID

Linear programming (90C05) Semi-infinite programming (90C34)

Cites Work

• Title not available (Why is that?)
• Some applications of optimization in matrix theory
• Linear equations and inequalities on finite dimensional, real or complex, vector spaces: a unified theory
• Title not available (Why is that?)
• Constrained \(L_ p\) approximation
• Characterizations of optimality without constraint qualification for the abstract convex program
• Generalizations of Farkas’ Theorem
• Title not available (Why is that?)
• Linear Programming in Reflexive Spaces

Cited In (22)

• Title not available (Why is that?)
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior
• Constrained best approximation in Hilbert space. II
• On conic QPCCs, conic QCQPs and completely positive programs
• A Dual Approach to Multidimensional $L_p$ Spectral Estimation Problems
• Gradient methods and conic least-squares problems
• A simple closure condition for the normal cone intersection formula
• On constraint qualifications in nonsmooth optimization.
• Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds
• Generalizations of Slater's constraint qualification for infinite convex programs
• Partially finite convex programming. II: Explicit lattice models
• Title not available (Why is that?)
• Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance
• Title not available (Why is that?)
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds
• Facial reduction in partially finite convex programming
• Constraint qualification with Schauder basis for infinite programming problems
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems
• A nonlinear equation for linear programming
• Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation
• Liberating the subgradient optimality conditions from constraint qualifications

This page was built for publication: A simple constraint qualification in infinite dimensional programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3731366)