A numerical embedding method for solving the nonlinear optimization problem

DOI10.1007/S11741-003-0005-ZzbMath1050.65062OpenAlexW2021098783MaRDI QIDQ4810955

Baofeng Tian, Yunxian Dai, Jian-Jun Zhang, Ze-Hong Meng

Publication date: 17 August 2004

Published in: Journal of Shanghai University (English Edition) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11741-003-0005-z

zbMATH Keywords

convergencenumerical examplesnonlinear optimizationhomotopy methodpath followingnumerical embedding methodbi-differentiable equations

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Global methods, including homotopy approaches to the numerical solution of nonlinear equations (65H20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Mathematical foundations of nonsmooth embedding methods
• Local convergence of quasi-Newton methods for B-differentiable equations
• A nonsmooth Newton method for variational inequalities. I: Theory
• On concepts of directional differentiability
• Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
• A nonsmooth version of Newton's method
• Nonsmooth Equations: Motivation and Algorithms
• Newton's Method for B-Differentiable Equations
• A relaxed projection method for variational inequalities
• Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
• Equivalence of the Complementarity Problem to a System of Nonlinear Equations
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations

This page was built for publication: A numerical embedding method for solving the nonlinear optimization problem