Pages that link to "Item:Q933800"
From MaRDI portal
The following pages link to The semismooth approach for semi-infinite programming under the reduction ansatz (Q933800):
Displaying 14 items.
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- On optimization, dynamics and uncertainty: A tutorial for gene-environment networks (Q1026224) (← links)
- Sufficient optimality and sensitivity analysis of a parameterized min-max programming (Q1760808) (← links)
- On Nesterov's approach to semi-infinite programming (Q1862263) (← links)
- Gauss-Newton-type methods for bilevel optimization (Q2028474) (← links)
- How to solve a semi-infinite optimization problem (Q2253347) (← links)
- A smoothing Levenberg-Marquardt method for generalized semi-infinite programming (Q2392971) (← links)
- Generalized semi-infinite programming: numerical aspects (Q2720274) (← links)
- The reduction ansatz in absence of lower semi-continuity (Q2722332) (← links)
- Lower level duality and the global solution of generalized semi-infinite programs (Q2810114) (← links)
- An exchange method with refined subproblems for convex semi-infinite programming problems (Q2829588) (← links)
- (Q2966394) (← links)
- Interior point filter method for semi-infinite programming problems (Q3111139) (← links)