Pages that link to "Item:Q4139993"

The following pages link to Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993):

Displaying 50 items.

• Two-step and three-step Q-superlinear convergence of SQP methods (Q1342465) (← 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)
• Performance of several nonlinear programming software packages on microcomputers. (Q1406691) (← links)
• A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
• A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations (Q1576323) (← links)
• Limited memory quasi-Newton method for large-scale linearly equality-constrained minimization (Q1582578) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
• Computational methods for optimum design of large complex systems (Q1820022) (← links)
• A robust sequential quadratic programming method (Q1825141) (← links)
• A globally convergent Newton method for convex \(SC^ 1\) minimization problems (Q1896575) (← links)
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
• A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
• Two-phase-SQP method with higher-order convergence property (Q2014053) (← links)
• Discrete LQR and ILQR methods based on high order Runge-Kutta discretizations (Q2085658) (← links)
• A Lagrange-Newton algorithm for sparse nonlinear programming (Q2089792) (← links)
• Alternative regularizations for outer-approximation algorithms for convex MINLP (Q2089881) (← links)
• Sparse quadratic programming in chemical process optimization (Q2368094) (← links)
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)
• An analysis of reduced Hessian methods for constrained optimization (Q2640451) (← links)
• Maintaining the positive definiteness of the matrices in reduced secant methods for equality constrained optimization (Q2641222) (← links)
• An augmented Lagrangian trust region method for equality constrained optimization (Q2943835) (← links)
• Discrete mechanics and optimal control: An analysis (Q3008424) (← links)
• Multilevel least-change Newton-like methods for equality constrained optimization problems (Q3028736) (← links)
• Generalized monotone line search SQP algorithm for constrained minimax problems (Q3622010) (← links)
• Procedures for optimization problems with a mixture of bounds and general linear constraints (Q3675917) (← links)
• A successive quadratic programming algorithm with global and superlinear convergence properties (Q3731379) (← links)
• A recursive quadratic programming algorithm that uses differentiable exact penalty functions (Q3734178) (← links)
• A globally convergent version of a general recursive algorithm for nonlinear programming (Q3741433) (← links)
• A two-stage feasible directions algorithm for nonlinear constrained optimization (Q3762086) (← links)
• Mise à jour de la métrique dans les méthodes de quasi-Newton réduites en optimisation avec contraintes d'égalité (Q3805800) (← links)
• On Secant Updates for Use in General Constrained Optimization (Q3807007) (← links)
• On the local and global convergence of a reduced Quasi-Newton method¹ (Q3832325) (← links)
• Exact penalty functions in nonlinear programming (Q3859569) (← links)
• Variable metric methods for minimizing a class of nondifferentiable functions (Q3883929) (← links)
• A method of centers algorithm for certain minimax problems (Q3929560) (← links)
• A globally convergent constrained quasi-Newton method with an augmented lagrangian type penalty function (Q3934150) (← links)
• A dual differentiable exact penalty function (Q3959752) (← links)
• Nonlinear programming via an exact penalty function: Asymptotic analysis (Q3967373) (← links)
• Algorithms for nonlinear constraints that use lagrangian functions (Q4162980) (← links)
• Some examples of cycling in variable metric methods for constrained minimization (Q4187603) (← links)
• Solving nonlinear programming problems with very many constraints (Q4327941) (← links)
• Regular and Critical States in Elastic Nonlinear Systems with Displacement Constraints (Q4528156) (← links)
• A Projected Gradient and Constraint Linearization Method for Nonlinear Model Predictive Control (Q4563378) (← links)
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization (Q4653552) (← links)