The following pages link to Daishi Kuroiwa (Q340374):
Displayed 50 items.
- Lagrange-type duality in DC programming problems with equivalent DC inequalities (Q340375) (← links)
- Necessary and sufficient conditions for some constraint qualifications in quasiconvex programming (Q412765) (← links)
- Necessary and sufficient constraint qualification for surrogate duality (Q415371) (← links)
- Lagrange-type duality in DC programming (Q489076) (← links)
- Convexity and global well-posedness in set-optimization (Q514809) (← links)
- Sandwich theorem for quasiconvex functions and its applications (Q531868) (← links)
- Strong convergence of averaging iterations of nonexpansive nonself-mappings (Q596708) (← links)
- Optimality conditions and the basic constraint qualification for quasiconvex programming (Q622397) (← links)
- On set containment characterization and constraint qualification for quasiconvex programming (Q637546) (← links)
- Nash equilibrium and saddle points for multifunctions (Q662351) (← links)
- Subdifferential calculus for a quasiconvex function with generator (Q719604) (← links)
- An evaluation of efficient points for vector optimization (Q1012954) (← links)
- Set containment characterization for quasiconvex programming (Q1041441) (← links)
- Item:Q340374 (redirect page) (← links)
- Another observation on conditions assuring \(\text{int }A+B= \text{int}(A+B)\) (Q1324435) (← links)
- Characterizations of the solution set for non-essentially quasiconvex programming (Q1686559) (← links)
- On set-valued optimization. (Q1875157) (← links)
- Convexity for set-valued maps (Q1921178) (← links)
- Optimality conditions for DC programming problems with reverse convex constraints (Q1937571) (← links)
- Some constraint qualifications for quasiconvex vector-valued systems (Q1945503) (← links)
- Robust Nash equilibria in vector-valued games with uncertainty (Q2158610) (← links)
- Convergence of solutions to set optimization problems with the set less order relation (Q2178884) (← links)
- Duality theorems for convex and quasiconvex set functions (Q2225642) (← links)
- Lagrange duality in canonical DC programming (Q2258474) (← links)
- The relationship between multi-objective robustness concepts and set-valued optimization (Q2264185) (← links)
- A characterization of cone-convexity for set-valued functions by cone-quasiconvexity (Q2346265) (← links)
- Characterizations of the solution set for quasiconvex programming in terms of Greenberg-Pierskalla subdifferential (Q2351521) (← links)
- Surrogate duality for robust optimization (Q2356091) (← links)
- Duality theorems for separable convex programming without qualifications (Q2359787) (← links)
- Nonlinear error bounds for quasiconvex inequality systems (Q2361132) (← links)
- The convexity of \(A\) and \(B\) assures \(\text{int} A + B = \text{int}(A + B)\) (Q2366000) (← links)
- Some general conditions assuring \(\text{int }A+B=\text{int}(A+B)\) (Q2367979) (← links)
- Quasiconvexity of set-valued maps assures well-posedness of robust vector optimization (Q2404335) (← links)
- On robust multiobjective optimization (Q2446151) (← links)
- (Q2740699) (← links)
- (Q2753318) (← links)
- (Q2789161) (← links)
- Generalized Minimality in Set Optimization (Q2805761) (← links)
- (Q2821647) (← links)
- (Q2842080) (← links)
- (Q3007190) (← links)
- (Q3104295) (← links)
- (Q3161410) (← links)
- A systematization of convexity and quasiconvexity concepts for set-valued maps, defined by<i>l</i>-type and<i>u</i>-type preorder relations (Q3177622) (← links)
- On the properties of lexicographic tolerable robust solution sets for uncertain multi-objective optimization problems (Q3384591) (← links)
- (Q3434759) (← links)
- (Q3434778) (← links)
- (Q3632477) (← links)
- (Q4252562) (← links)
- (Q4253483) (← links)