Pages that link to "Item:Q4852584"
From MaRDI portal
The following pages link to Local Convergence of SQP Methods in Semi-Infinite Programming (Q4852584):
Displaying 13 items.
- Relaxed cutting plane method with convexification for solving nonlinear semi-infinite programming problems (Q694542) (← links)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints (Q740634) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
- On the numerical treatment of linearly constrained semi-infinite optimization problems (Q1969893) (← links)
- An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs (Q1987416) (← links)
- A new adaptive method to nonlinear semi-infinite programming (Q2076380) (← links)
- An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← links)
- On linear-quadratic elliptic control problems of semi-infinite type (Q3006695) (← links)
- Interior point filter method for semi-infinite programming problems (Q3111139) (← 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)
- Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)
