The following pages link to Jae Hyoung Lee (Q261807):
Displaying 33 items.
- On \(\epsilon\)-solutions for robust fractional optimization problems (Q261808) (← links)
- On \(\epsilon\)-solutions for convex optimization problems with uncertainty data (Q270047) (← links)
- Finding efficient solutions in robust multiple objective optimization with SOS-convex polynomial data (Q828872) (← links)
- \(\varepsilon \)-duality theorems for convex semidefinite optimization problems with conic constraints (Q962489) (← links)
- Genericity and Hölder stability in semi-algebraic variational inequalities (Q1670008) (← links)
- On approximate solutions for robust convex semidefinite optimization problems (Q1670443) (← links)
- On quasi \(\epsilon\)-solution for robust convex optimization problems (Q1686550) (← links)
- Approximate optimality and approximate duality for quasi approximate solutions in robust convex semidefinite programs (Q1706408) (← links)
- On optimality conditions and duality theorems for robust semi-infinite multiobjective optimization problems (Q1730467) (← links)
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data (Q1743539) (← links)
- On minimizing difference of a SOS-convex polynomial and a support function over a SOS-concave matrix polynomial constraint (Q1749450) (← links)
- A hybrid approach for finding efficient solutions in vector optimization with SOS-convex polynomials (Q1984696) (← links)
- Multi-objective convex polynomial optimization and semidefinite programming relaxations (Q2038921) (← links)
- Finding efficient solutions for multicriteria optimization problems with SOS-convex polynomials (Q2279398) (← links)
- On \(\epsilon\)-solutions for robust semi-infinite optimization problems (Q2321908) (← links)
- Multi-objective optimization problems with SOS-convex polynomials over an LMI constraint (Q2663356) (← links)
- Sums of squares polynomial program reformulations for adjustable robust linear optimization problems with separable polynomial decision rules (Q2677664) (← links)
- (Q2787024) (← links)
- (Q2789157) (← links)
- (Q2789232) (← links)
- An alternative theorem for set-valued maps via set relations and its application to robustness of feasible sets (Q3177620) (← links)
- (Q4617658) (← links)
- Openness, Hölder Metric Regularity, and Hölder Continuity Properties of Semialgebraic Set-Valued Maps (Q5026839) (← links)
- (Q5045850) (← links)
- (Q5058515) (← links)
- (Q5151474) (← links)
- (Q5745068) (← links)
- Sum-of-squares relaxations in robust DC optimization and feature selection (Q6142071) (← links)
- A utopia point method-based robust vector polynomial optimization scheme (Q6154404) (← links)
- A parameter-free approach for solving SOS-convex semi-algebraic fractional programs (Q6519478) (← links)
- On solution set for semidefinite optimization problems (Q6637973) (← links)
- Generalized semi-infinite polynomial optimization and semidefinite programming relaxations (Q6650707) (← links)
- Fermat's rule at infinity in non-degenerate semi-algebraic optimization (Q6664296) (← links)
