A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations

DOI10.1007/S11766-000-0028-1MaRDI QIDQ1576323zbMATH OpenOpenAlexFDO

Authors Wei Wang, Yifan Xu

Publication date 7 December 2000

Published in Applied Mathematics. Series B (English Edition) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11766-000-0028-1

zbMATH Keywords

constrained optimizationssequential quadratic programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Methods of successive quadratic programming type (90C55)

Recommendations

• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
• scientific article; zbMATH DE number 851560
• A superlinearly convergent hybrid algorithm for solving nonlinear programming
• A constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence
• A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
• scientific article; zbMATH DE number 883157
• scientific article; zbMATH DE number 4154228
• scientific article; zbMATH DE number 1159542
• A nonmonotone line search method and its convergence for unconstrained optimization
• A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems

Cites work

• A Nonmonotone Line Search Technique for Newton’s Method
• A surperlinearly convergent algorithm for constrained optimization problems
• Generalized equations and their solutions, part II: Applications to nonlinear programming
• Local analysis of Newton-type methods for variational inequalities and nonlinear programming
• Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems
• Sequential Quadratic Programming with Penalization of the Displacement
• Superlinearly convergent variable metric algorithms for general nonlinear programming problems
• The watchdog technique for forcing convergence in algorithms for constrained optimization

Cited in

(8)

• A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
• New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
• A method combining norm-relaxed QP subproblems with systems of linear equations for constrained optimization
• Pénalités mixtes : un algorithme superlinéaire en deux étapes
• A Mixed and Superlinearly Convergent Algorithm for Constrained Optimization
• Descending dimension algorithm for nonlinear optimization problem with mixed linear constraints
• A Superlinearly Convergent Algorithm for the Monotone Nonlinear Complementarity Problem Without Uniqueness and Nondegeneracy Conditions
• A new superlinearly convergent norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization

This page was built for publication: A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1576323)