Pages that link to "Item:Q3731366"

The following pages link to A simple constraint qualification in infinite dimensional programming (Q3731366):

Displaying 17 items.

• On conic QPCCs, conic QCQPs and completely positive programs (Q312665) (← links)
• Optimality conditions for Henig and globally proper efficient solutions with ordering cone has empty interior (Q555821) (← links)
• On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
• A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds (Q763390) (← links)
• Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
• Partially finite convex programming. II: Explicit lattice models (Q1198329) (← links)
• Generalizations of Slater's constraint qualification for infinite convex programs (Q1198330) (← links)
• Constrained best approximation in Hilbert space. II (Q1201286) (← links)
• Quasi interiors, Lagrange multipliers, and \(L^ p\) spectral estimation with lattice bounds (Q1321370) (← links)
• Constraint qualifications and Lagrange multipliers in nondifferentiable programming problems (Q1331123) (← links)
• Facial reduction in partially finite convex programming (Q1334956) (← links)
• Smooth and Semismooth Newton Methods for Constrained Approximation and Estimation (Q2895679) (← links)
• Gradient methods and conic least-squares problems (Q3458817) (← links)
• A nonlinear equation for linear programming (Q3724087) (← links)
• Error Bounds and Multipliers in Constrained Optimization Problems with Tolerance (Q4624931) (← links)
• A simple closure condition for the normal cone intersection formula (Q4654124) (← links)
• Robust optimality and duality for composite uncertain multiobjective optimization in Asplund spaces with its applications (Q6197115) (← links)