Pages that link to "Item:Q1379971"

The following pages link to Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971):

Displaying 27 items.

• On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
• On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
• Optimality theorems for convex semidefinite vector optimization problems (Q425863) (← links)
• Duality and optimality conditions for generalized equilibrium problems involving DC functions (Q708896) (← links)
• Linear regularity, equirregularity, and intersection mappings for convex semi-infinite inequality systems (Q849317) (← links)
• Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs (Q849329) (← links)
• Liberating the subgradient optimality conditions from constraint qualifications (Q857800) (← links)
• Characterizations of optimal solution sets of convex infinite programs (Q1024702) (← links)
• Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
• On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
• Approximate optimality conditions for composite convex optimization problems (Q1689064) (← links)
• Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
• Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs (Q1771100) (← links)
• Characterizing global optimality for DC optimization problems under convex inequality constraints (Q1924070) (← links)
• On \(\varepsilon\)-optimality conditions for multiobjective fractional optimization problems (Q1952121) (← links)
• On robust approximate optimal solutions for fractional semi-infinite optimization with uncertainty data (Q2067760) (← links)
• Sequential characterizations of approximate solutions in convex vector optimization problems with set-valued maps (Q2176278) (← links)
• On approximate solutions and saddle point theorems for robust convex optimization (Q2228362) (← links)
• Multiobjective DC programs with infinite convex constraints (Q2249821) (← links)
• On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
• The stable duality of DC programs for composite convex functions (Q2358470) (← links)
• Lagrange multiplier rules for non-differentiable DC generalized semi-infinite programming problems (Q2392776) (← links)
• Characterizations of solution sets of convex vector minimization problems (Q2503214) (← links)
• Sequential optimality conditions for multiobjective fractional programming problems (Q2512875) (← links)
• Optimality conditions for composite DC infinite programming problems (Q2691286) (← links)
• (Q3384701) (← links)
• New Farkas-type constraint qualifications in convex infinite programming (Q5428420) (← links)