Pages that link to "Item:Q1159954"
From MaRDI portal
The following pages link to Globally convergent methods for semi-infinite programming (Q1159954):
Displaying 16 items.
- An exact penalty function algorithm for semi-infinite programmes (Q751775) (← links)
- An interior semi-infinite programming method (Q1093544) (← links)
- A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218) (← links)
- A sequential quadratic programming with a dual parametrization approach to nonlinear semi-infinite programming (Q1433470) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- Numerical experiments in semi-infinite programming (Q1816403) (← links)
- Global convergence of a class of smooth penalty methods for semi-infinite programming (Q1937778) (← links)
- A homotopy interior point method for semi-infinite programming problems (Q2385505) (← links)
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems (Q2390009) (← links)
- A fast algorithm for the optimal design of high accuracy windows in signal processing (Q2867415) (← links)
- An iterative method for solving KKT system of the semi-infinite programming (Q3369516) (← links)
- A reduction method for semi-infinite programming by means of a global stochastic approach† (Q3391897) (← links)
- A projected lagrangian algorithm for semi-infinite programming (Q3690591) (← links)
- An exact penalty function for semi-infinite programming (Q3762085) (← links)
- A quasi-Newton interior point method for semi-infinite programming (Q4650627) (← links)
- Formulas of first-ordered and second-ordered generalization differentials for convex robust systems with applications (Q6107989) (← links)