Pages that link to "Item:Q1681319"

The following pages link to Constraint qualifications for convex optimization without convexity of constraints: new connections and applications to best approximation (Q1681319):

Displayed 13 items.

• New qualification conditions for convex optimization without convex representation (Q828724) ‎ (← links)
• Subdifferential of the supremum via compactification of the index set (Q2022436) ‎ (← links)
• Optimality conditions for nonconvex problems over nearly convex feasible sets (Q2048940) ‎ (← links)
• Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) ‎ (← links)
• Convex optimization without convexity of constraints on non-necessarily convex sets and its applications in customer satisfaction in automotive industry (Q2167953) ‎ (← links)
• Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) ‎ (← links)
• A comparison of normal cone conditions for homotopy methods for solving inequality constrained nonlinear programming problems (Q2246543) ‎ (← links)
• Moreau--Rockafellar-Type Formulas for the Subdifferential of the Supremum Function (Q4634099) ‎ (← links)
• Nonsmooth Constraint Qualifications for Nonconvex Inequality Systems (Q5039375) ‎ (← links)
• (Q5121102) ‎ (← links)
• Optimality Conditions for Nonconvex Constrained Optimization Problems (Q5238081) ‎ (← links)
• Convergences for robust bilevel polynomial programmes with applications (Q6078425) ‎ (← links)
• (Q6155210) ‎ (← links)