Pages that link to "Item:Q1024702"
From MaRDI portal
The following pages link to Characterizations of optimal solution sets of convex infinite programs (Q1024702):
Displaying 26 items.
- \(\varepsilon \)-mixed type duality for nonconvex multiobjective programs with an infinite number of constraints (Q377740) (← links)
- Some new properties of the Lagrange function and its applications (Q385666) (← links)
- A new approach to characterize the solution set of a pseudoconvex programming problem (Q390484) (← links)
- Weak stability and strong duality of a class of nonconvex infinite programs via augmented Lagrangian (Q454254) (← links)
- Semi-infinite optimization under convex function perturbations: Lipschitz stability (Q535062) (← links)
- \(\epsilon \)-optimal solutions in nonconvex semi-infinite programs with support functions (Q536840) (← links)
- Characterizations of the solution sets of convex programs and variational inequality problems (Q868556) (← links)
- \(\varepsilon \)-optimality and \(\varepsilon \)-Lagrangian duality for a nonconvex programming problem with an infinite number of constraints (Q1028592) (← links)
- In a semi-infinite program only a countable subset of the constraints is essential (Q1079497) (← links)
- Optimal solution characterization for infinite positive semi-definite programming (Q1334827) (← links)
- Asymptotic dual conditions characterizing optimality for infinite convex programs (Q1379971) (← links)
- Characterizations of robust solution set of convex programs with uncertain data (Q1670545) (← links)
- Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs (Q1771100) (← links)
- Simple bilevel programming and extensions (Q2039237) (← links)
- An approach to characterizing \(\epsilon\)-solution sets of convex programs (Q2146365) (← links)
- Characterizing the solution set of convex optimization problems without convexity of constraints (Q2191285) (← links)
- Characterizing robust solution sets of convex programs under data uncertainty (Q2260682) (← links)
- Some characterizations of robust solution sets for uncertain convex optimization problems with locally Lipschitz inequality constraints (Q2338487) (← links)
- Characterizations of solution sets of differentiable quasiconvex programming problems (Q2420773) (← links)
- The characterizations of optimal solution set in programming problem under inclusion constrains (Q2425984) (← links)
- Characterizations of solution sets of convex vector minimization problems (Q2503214) (← links)
- Sequential subdifferential for multi-composed functions via perturbation approach (Q2695259) (← links)
- Characteristics of semi-convex frontier optimization (Q2790869) (← links)
- (Q4257432) (← links)
- Characterizing the Solution Set for Nonconvex Semi-Infinite Programs Involving Tangential Subdifferentials (Q4985185) (← links)
- (Q5019048) (← links)
