Pages that link to "Item:Q1262218"

The following pages link to A globally convergent SQP method for semi-infinite nonlinear optimization (Q1262218):

Displaying 26 items.

• Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems (Q288406) (← links)
• Solving semi-infinite programs by smoothing projected gradient method (Q480937) (← links)
• 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 exact penalty function algorithm for semi-infinite programmes (Q751775) (← links)
• Study of a special nonlinear problem arising in convex semi-infinite programming (Q844519) (← links)
• A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
• A comparative study of several semi-infinite nonlinear programming algorithms (Q1102202) (← links)
• Some outer approximation methods for semi-infinite optimization problems (Q1343650) (← links)
• Filter trust region method for nonlinear semi-infinite programming problem (Q1720831) (← links)
• A smoothing Newton method for semi-infinite programming (Q1777435) (← links)
• Numerical experiments in semi-infinite programming (Q1816403) (← links)
• An augmented Lagrangian algorithm for solving semiinfinite programming (Q1952762) (← 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)
• A smoothing Levenberg-Marquardt algorithm for semi-infinite programming (Q2352422) (← links)
• Global convergence of a robust smoothing SQP method for semi-infinite programming (Q2370033) (← links)
• Non-convex semi-infinite min-max optimization with noncompact sets (Q2411166) (← links)
• Stability analysis of stochastic programs with second order dominance constraints (Q2434984) (← links)
• Semidefinite relaxations for semi-infinite polynomial programming (Q2450900) (← links)
• An Efficient Algorithm for Min-Max Convex Semi-Infinite Programming Problems (Q2829601) (← 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)
• On Solving the Convex Semi-Infinite Minimax Problems via Superlinear 𝒱𝒰 Incremental Bundle Technique with Partial Inexact Oracle (Q5024906) (← links)
• Convergent Algorithms for a Class of Convex Semi-infinite Programs (Q5043283) (← links)
• Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints (Q6038645) (← links)