Pages that link to "Item:Q1230357"

The following pages link to Diagonalized multiplier methods and quasi-Newton methods for constrained optimization (Q1230357):

Displaying 42 items.

• A primal-dual augmented Lagrangian (Q434173) (← links)
• A family of the local convergence of the improved secant methods for nonlinear equality constrained optimization subject to bounds on variables (Q488922) (← links)
• Nonmonotone filter DQMM method for the system of nonlinear equations (Q548014) (← links)
• Complementary energy approach to contact problems based on consistent augmented Lagrangian formulation (Q699363) (← links)
• Augmented Lagrangians which are quadratic in the multiplier (Q754765) (← links)
• A note on the method of multipliers (Q795734) (← links)
• A robust and informative method for solving large-scale power flow problems (Q887172) (← links)
• Approximate quasi-Newton methods (Q910338) (← links)
• Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
• A primal-dual Newton-type algorithm for geometric programs with equality constraints (Q1062918) (← links)
• On differentiable exact penalty functions (Q1065714) (← links)
• Dual techniques for constrained optimization (Q1091272) (← links)
• A heuristic algorithm for nonlinear programming (Q1093535) (← links)
• A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
• Recent developments in constrained optimization (Q1112728) (← links)
• Algorithms for a class of nondifferentiable problems (Q1136702) (← links)
• On a Newton-like method for constrained nonlinear minimization via slack variables (Q1148811) (← links)
• Enlarging the region of convergence of Newton's method for constrained optimization (Q1149235) (← links)
• A globally convergent algorithm based on imbedding and parametric optimization (Q1171362) (← links)
• Partitioned quasi-Newton methods for nonlinear equality constrained optimization (Q1184335) (← links)
• On the convergence properties of second-order multiplier methods (Q1240019) (← links)
• Local convergence of the diagonalized method of multipliers (Q1245159) (← links)
• A geometric method in nonlinear programming (Q1253613) (← links)
• Properties of updating methods for the multipliers in augmented Lagrangians (Q1256396) (← links)
• Perturbation lemma for the Newton method with application to the SQP Newton method (Q1265001) (← links)
• New theoretical results on recursive quadratic programming algorithms (Q1265011) (← links)
• Equality and inequality constrained optimization algorithms with convergent stepsizes (Q1321310) (← links)
• Analysis and implementation of a dual algorithm for constrained optimization (Q1321425) (← links)
• Two-step and three-step Q-superlinear convergence of SQP methods (Q1342465) (← links)
• Discriminant analysis and density estimation on the finite d-dimensional grid (Q1351087) (← links)
• Interior-point methods: An old and new approach to nonlinear programming (Q1365059) (← links)
• Convergence rate of the augmented Lagrangian SQP method (Q1372541) (← links)
• An implementation of Newton-like methods on nonlinearly constrained networks (Q1765533) (← links)
• Numerical experience with a polyhedral-norm CDT trust-region algorithm (Q1896572) (← links)
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451) (← links)
• Efficient alternating minimization methods for variational edge-weighted colorization models (Q2000545) (← links)
• Augmented Lagrangian homotopy method for the regularization of total variation denoising problems (Q2454731) (← links)
• An analysis of reduced Hessian methods for constrained optimization (Q2640451) (← links)
• Decomposition Methods Based on Augmented Lagrangians: A Survey (Q2912155) (← links)
• Variants of the reduced Newton method for nonlinear equality constrained optimization problems (Q3028735) (← links)
• Multilevel least-change Newton-like methods for equality constrained optimization problems (Q3028736) (← links)
• The strict superlinear order can be faster than the infinite order (Q6200832) (← links)