Pages that link to "Item:Q4136969"

The following pages link to Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems (Q4136969):

Displaying 36 items.

• On-line optimization of gas pipeline networks (Q922324) (← links)
• Global convergence of an SQP method without boundedness assumptions on any of the iterative sequences (Q1016107) (← links)
• Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
• A globally convergent algorithm for nonlinearly constrained optimization problems (Q1071653) (← links)
• A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
• Iterative linear programming solution of convex programs (Q1120478) (← links)
• A robust secant method for optimization problems with inequality constraints (Q1136347) (← links)
• Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
• A recursive quadratic programming algorithm for semi-infinite optimization problems (Q1169401) (← links)
• An algorithm for solving linearly constrained minimax problems (Q1169406) (← links)
• Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
• A globally convergent method for nonlinear programming (Q1229804) (← links)
• Interior proximal point algorithm for linear programs (Q1321229) (← links)
• Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
• Gauss-Newton methods for the complementarity problem (Q1321346) (← links)
• Superlinearly convergent approximate Newton methods for LC\(^ 1\) optimization problems (Q1332309) (← links)
• A generalized projection-successive linear equations algorithm for nonlinearly equality and inequality constrained optimization and its rate of convergence (Q1370303) (← links)
• Iterative bundle-based decomposition for large-scale nonseparable convex optimization (Q1806873) (← links)
• Computational methods for optimum design of large complex systems (Q1820022) (← links)
• A robust sequential quadratic programming method (Q1825141) (← links)
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
• A parallel inexact Newton method for stochastic programs with recourse (Q1918424) (← links)
• A sequential quadratic programming method for constrained multi-objective optimization problems (Q2053082) (← links)
• Variations and extension of the convex-concave procedure (Q2358020) (← links)
• Globally and superlinearly convergent trust-region algorithm for convex \(SC^ 1\)-minimization problems and its application to stochastic programs (Q2565034) (← links)
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)
• Exact penalty functions in nonlinear programming (Q3859569) (← 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)
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems (Q4139993) (← links)
• Algorithms for nonlinear constraints that use lagrangian functions (Q4162980) (← links)
• Some examples of cycling in variable metric methods for constrained minimization (Q4187603) (← links)
• The linearization method (Q4729625) (← links)
• Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs (Q5501232) (← links)
• YAM2: yet another library for the \(M_2\) variables using sequential quadratic programming (Q6104218) (← links)