Pages that link to "Item:Q2370062"

The following pages link to Necessary optimality conditions in terms of convexificators in Lipschitz optimization (Q2370062):

Displaying 30 items.

• Optimality conditions and duality for interval-valued optimization problems using convexifactors (Q276276) (← links)
• Duality for nonsmooth optimization problems with equilibrium constraints, using convexificators (Q346833) (← links)
• Duality for multiobjective fractional programming problem using convexifactors (Q387092) (← links)
• Optimality conditions for optimistic bilevel programming problem using convexifactors (Q415386) (← links)
• Generalized nonsmooth cone convexity in terms of convexifactors in vector optimization (Q505143) (← links)
• Optimality and duality results for bilevel programming problem using convexifactors (Q637559) (← links)
• Convexificators and strong Kuhn-Tucker conditions (Q692289) (← links)
• Existence and boundedness of the Kuhn-Tucker multipliers in nonsmooth multiobjective optimization (Q987521) (← links)
• Nonsmooth calculus, minimality, and monotonicity of convexificators (Q1301893) (← links)
• Optimality conditions and duality for semi-infinite mathematical programming problems with equilibrium constraints, using convexificators (Q1730476) (← links)
• Optimality conditions and duality in terms of convexificators for multiobjective bilevel programming problem with equilibrium constraints (Q1983853) (← links)
• Optimality conditions in convex optimization with locally Lipschitz constraints (Q2311199) (← links)
• Optimality conditions for nonsmooth semidefinite programming via convexificators (Q2355132) (← links)
• Sufficient optimality conditions using convexifactors for optimistic bilevel programming problem (Q2666718) (← links)
• Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators (Q2790868) (← links)
• Characterization of (weakly/properly/robust) efficient solutions in nonsmooth semi-infinite multiobjective optimization using convexificators (Q4639127) (← links)
• Multiobjective Problems: Enhanced Necessary Conditions and New Constraint Qualifications through Convexificators (Q4639187) (← links)
• Necessary optimality conditions for a bilevel multiobjective programming problem via a Ψ-reformulation (Q4646549) (← links)
• Improved enhanced Fritz John condition and constraints qualifications using convexificators (Q5002218) (← links)
• Optimality and duality for nonsmooth minimax programming problems using convexifactor (Q5020437) (← links)
• Efficiency conditions for multiobjective bilevel programming problems via convexificators (Q5152038) (← links)
• Necessary and sufficient optimality conditions using convexifactors for mathematical programs with equilibrium constraints (Q5214315) (← links)
• Necessary optimality conditions for countably infinite Lipschitz problems with equality constraint mappings (Q5963691) (← links)
• Duality results for interval-valued semiinfinite optimization problems with equilibrium constraints using convexificators (Q6038921) (← links)
• Applying convexificators in robust multiobjective optimization (Q6086987) (← links)
• Optimality Conditions Using Convexifactors for a Multiobjective Fractional Bilevel Programming Problem (Q6107695) (← links)
• Constraint qualifications in terms of convexificators for nonsmooth programming problems with mixed constraints (Q6169208) (← links)
• Optimality conditions for MPECs in terms of directional upper convexifactors (Q6186580) (← links)
• On approximate strong KKT points of nonsmooth interval-valued mutiobjective optimization problems using convexificators (Q6621087) (← links)
• Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators (Q6635232) (← links)