Pages that link to "Item:Q1579665"

The following pages link to On optimality conditions for generalized semi-infinite programming problems (Q1579665):

Displaying 26 items.

• Convex SIP problems with finitely representable compact index sets: immobile indices and the properties of the auxiliary NLP problem (Q494875) (← links)
• On constraint qualifications in nonsmooth optimization. (Q703169) (← links)
• On the use of augmented Lagrangians in the solution of generalized semi-infinite min-max problems (Q812415) (← links)
• Semi-infinite programming (Q869581) (← links)
• On generalized semi-infinite programming. (With comments and rejoinder). (Q874881) (← links)
• Generalized semi-infinite programming: a tutorial (Q929611) (← links)
• First order optimality conditions for generalized semi-infinite programming problems (Q946193) (← links)
• Necessary optimality conditions for nonsmooth generalized semi-infinite programming problems (Q976438) (← links)
• Convex semi-infinite programming: Implicit optimality criterion based on the concept of immobile indices (Q987504) (← links)
• \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
• Optimality conditions for convex semi-infinite programming problems with finitely representable compact index sets (Q1682971) (← links)
• Bilevel decision with generalized semi-infinite optimization for fuzzy mappings as lower level problems (Q1774610) (← links)
• On generalized semi-infinite optimization and bilevel optimization (Q1847253) (← links)
• A conceptual method for solving generalized semi-infinite programming problems via global optimization by exact discontinuous penalization (Q1877015) (← links)
• The model for two-dimensional layout optimization problem with performance constraints and its optimality function (Q1884651) (← links)
• Implicit optimality criterion for convex SIP problem with box constrained index set (Q1939083) (← links)
• How to solve a semi-infinite optimization problem (Q2253347) (← links)
• A fuzzy semi-infinite optimization problem (Q2405739) (← links)
• Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
• Nonlinear robust optimization via sequential convex bilevel programming (Q2434994) (← links)
• Generalized Levitin-Polyak Well-Posedness for Generalized Semi-Infinite Programs (Q2841922) (← links)
• Generalized Semi-Infinite Programming: Optimality Conditions Involving Reverse Convex Problems (Q2877727) (← links)
• ON FIRST-ORDER NECESSARY CONDITIONS FOR OPTIMALITY OF REGULAR GENERALIZED SEMI-INFINITE PROGRAMMING (Q4917817) (← links)
• (Q5094791) (← links)
• An extended conjugate duality for generalized semi-infinite programming problems via a convex decomposition (Q5131821) (← links)
• On a constructive approach to optimality conditions for convex SIP problems with polyhedral index sets (Q5413872) (← links)