Pages that link to "Item:Q2566244"
From MaRDI portal
The following pages link to Limiting \(\varepsilon\)-subgradient characterizations of constrained best approximation (Q2566244):
Displaying 14 items.
- Total Lagrange duality for DC infinite optimization problems (Q401875) (← links)
- Lagrange multiplier characterizations of robust best approximations under constraint data uncertainty (Q432370) (← links)
- Rejoinder on: ``Farkas' lemma: three decades of generalizations for mathematical optimization'' (Q458937) (← links)
- Constraint qualifications for optimality conditions and total Lagrange dualities in convex infinite programming (Q984086) (← links)
- Characterizing best approximation from a convex set without convex representation (Q1717625) (← links)
- Stable zero Lagrange duality for DC conic programming (Q1952895) (← links)
- Constraint qualifications characterizing Lagrangian duality in convex optimization (Q1956463) (← links)
- Robust constrained best approximation with nonconvex constraints (Q2022294) (← links)
- Lagrange multiplier characterizations of constrained best approximation with infinite constraints (Q2046540) (← links)
- Some relationships among the constraint qualifications for Lagrangian dualities in DC infinite optimization problems (Q2261970) (← links)
- Strong and total Lagrange dualities for quasiconvex programming (Q2336429) (← links)
- Lagrange multiplier characterizations of constrained best approximation with nonsmooth nonconvex constraints (Q5081362) (← links)
- Pareto-Fenchel ε-Subdifferential Composition Rule and ε-Efficiency (Q5409722) (← links)
- Best Approximation in a Class of Normed Spaces with Star-Shaped Cone (Q5478746) (← links)
