Pages that link to "Item:Q1825141"

The following pages link to A robust sequential quadratic programming method (Q1825141):

Displaying 50 items.

• A restoration-free filter SQP algorithm for equality constrained optimization (Q371507) (← links)
• A line search exact penalty method using steering rules (Q431002) (← links)
• Global and local convergence of a nonmonotone SQP method for constrained nonlinear optimization (Q480926) (← links)
• A kind of nonmonotone filter method for nonlinear complementarity problem (Q545563) (← links)
• Sequential penalty algorithm for nonlinear constrained optimization (Q597213) (← links)
• NE/SQP: A robust algorithm for the nonlinear complementarity problem (Q689133) (← links)
• A trust region SQP-filter method for nonlinear second-order cone programming (Q692204) (← links)
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• A superlinearly convergent implicit smooth SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q812423) (← links)
• A decoupling approach for time-dependent robust optimization with application to power semiconductor devices (Q821765) (← links)
• A smoothing QP-free infeasible method for nonlinear inequality constrained optimization (Q933072) (← links)
• A globally and superlinearly convergent modified SQP-filter method (Q933797) (← links)
• Global convergence of a robust filter SQP algorithm (Q976392) (← links)
• A modified SQP-filter method and its global convergence (Q990647) (← links)
• An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
• A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
• A modified SQP method with nonmonotone technique and its global convergence (Q1029867) (← links)
• A new successive quadratic programming algorithm (Q1210225) (← links)
• A new technique for inconsistent QP problems in the SQP method (Q1298765) (← links)
• Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
• Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
• An algorithm of sequential systems of linear equations for nonlinear optimization problems with arbitrary initial point (Q1367215) (← links)
• New sequential quadratic programming algorithm with consistent subproblems (Q1368267) (← links)
• A SQP method for inequality constrained optimization. (Q1611084) (← links)
• Error bounds and finite termination for constrained optimization problems (Q1717787) (← links)
• Augmented Lagrangian and exact penalty methods for quasi-variational inequalities (Q1744910) (← links)
• Global convergence on an active set SQP for inequality constrained optimization (Q1779428) (← links)
• A new result on second-order necessary conditions for nonlinear programming (Q1785337) (← links)
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
• Exact barrier function methods for Lipschitz programs (Q1895790) (← 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)
• A superlinearly convergent SSDP algorithm for nonlinear semidefinite programming (Q2067987) (← links)
• On the augmented subproblems within sequential methods for nonlinear programming (Q2403109) (← links)
• A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
• Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514) (← links)
• A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
• A feasible filter SQP algorithm with global and local convergence (Q2511102) (← links)
• On the numerical modeling of convex particle assemblies with friction (Q2564595) (← links)
• Majorization-Minimization Procedures and Convergence of SQP Methods for Semi-Algebraic and Tame Programs (Q2806813) (← links)
• Augmented Lagrangian Methods for the Solution of Generalized Nash Equilibrium Problems (Q2826819) (← links)
• Some new facts about sequential quadratic programming methods employing second derivatives (Q2829576) (← links)
• An interior point method for nonlinear programming with infeasibility detection capabilities (Q2926056) (← links)
• An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming (Q2945128) (← links)
• Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver (Q3300768) (← links)
• A robust SQP method based on a smoothing lower order penalty function† (Q3622004) (← links)
• An infeasible active-set QP-free algorithm for general nonlinear programming (Q4976293) (← links)