Pages that link to "Item:Q4509844"

The following pages link to A Robust Algorithm for Optimization with General Equality and Inequality Constraints (Q4509844):

Displaying 28 items.

• A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
• A feasible descent SQP algorithm for general constrained optimization without strict complemen\-tar\-ity (Q556270) (← links)
• Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
• A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• Nonlinear programming without a penalty function or a filter (Q847849) (← links)
• A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
• Global convergence on an active set SQP for inequality constrained optimization (Q1779428) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
• Robust optimality in constrained optimization problems with application in mechanics (Q2157701) (← links)
• Robust penalty function method for an uncertain multi-time control optimization problems (Q2235881) (← links)
• A wedge trust region method with self-correcting geometry for derivative-free optimization (Q2353471) (← links)
• Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints (Q2372939) (← links)
• A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
• A robust trust region method for nonlinear optimization with inequality constraint (Q2496002) (← links)
• A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
• A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization (Q2510002) (← links)
• Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions (Q2569198) (← links)
• A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
• An SQP method for minimization of locally Lipschitz functions with nonlinear constraints (Q4631819) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• Necessary and sufficient optimality conditions for some robust variational problems (Q6054496) (← links)
• Robust saddle‐point criterion in second‐order partial differential equation and partial differential inequation constrained control problems (Q6082373) (← links)
• An overview of nonlinear optimization (Q6200213) (← links)