The following pages link to (Q3101681):
Displaying 27 items.
- On the solution of convex bilevel optimization problems (Q263155) (← links)
- A duality approach for a class of semivectorial bilevel programming problems (Q684051) (← links)
- Optimality conditions and a barrier method in optimization with convex geometric constraint (Q1653288) (← links)
- Simple bilevel programming and extensions (Q2039237) (← links)
- Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization (Q2077957) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- On solving a class of fractional semi-infinite polynomial programming problems (Q2231044) (← links)
- On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives (Q2311119) (← links)
- Optimality conditions in convex optimization with locally Lipschitz constraints (Q2311199) (← links)
- A hybrid subgradient algorithm for finding a common solution of an equilibrium problem and a family of strict pseudocontraction mappings (Q2336163) (← links)
- Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming (Q2342953) (← links)
- Characteristics of semi-convex frontier optimization (Q2790869) (← links)
- Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem (Q4622791) (← links)
- DC approach to weakly convex optimization and nonconvex quadratic optimization problems (Q4639126) (← links)
- (Q4969112) (← links)
- Algorithms for Simple Bilevel Programming (Q5014631) (← links)
- Approximate solutions of interval-valued optimization problems (Q5019102) (← links)
- Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. (Q5115803) (← links)
- (Q5121077) (← links)
- (Q5233672) (← links)
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems (Q5244131) (← links)
- Optimality conditions for mixed discrete bilevel optimization problems (Q5745161) (← links)
- The second boundary value problem for a discrete Monge-Ampère equation (Q6077290) (← links)
- A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems (Q6187726) (← links)
- Duality in convex optimization for the hyperbolic augmented Lagrangian (Q6500232) (← links)
- A support function approach for characterizations of convex normal cone (Q6621979) (← links)
- Approximate optimality conditions and sensitivity analysis in nearly convex optimization (Q6665564) (← links)
