A Gauss-Newton Approach to Solving Generalized Inequalities

DOI10.1287/MOOR.11.4.632MaRDI QIDQ3762088zbMATH OpenOpenAlexFDO

Authors

Publication date 1986

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/moor.11.4.632

zbMATH Keywords

convergencepartial orderGauss-Newtonclosed convex coneClarke subgradientgeneralized inequalityK-regular

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)

Recommendations

• A damped Gauss-Newton method for solving nonlinear inequalities
• scientific article; zbMATH DE number 5936419
• Majorizing Functions and Convergence of the Gauss–Newton Method for Convex Composite Optimization
• scientific article; zbMATH DE number 764397
• Generalized equations and the generalized Newton method

Cited in

(22)

• A Levenberg-Marquardt method for nonsmooth regularized least squares
• Descent methods for composite nondifferentiable optimization problems
• Numerical solution for bounding feasible point sets
• A robust sequential quadratic programming method
• A parallel projection method for solving generalized linear least-squares problems
• Subdifferentials of perturbed distance functions in Banach spaces
• NE/SQP: A robust algorithm for the nonlinear complementarity problem
• Second order sufficient optimality conditions in vector optimization
• New formulas for subdifferentials of perturbed distance functions
• An algorithm for finding a solution to the inclusion 0\(\in F(x)\)
• Second order necessary and sufficient conditions for convex composite NDO
• Necessary conditions for weak sharp minima in cone-constrained optimization problems
• Optimality conditions for bilevel programming problems
• Sharp efficiency for vector equilibrium problems on Banach spaces
• An exact penalty method for nonconvex problems covering, in particular, nonlinear programming, semidefinite programming, and second-order cone programming
• Analysis and implementation of a dual algorithm for constrained optimization
• Weak sharp solutions for variational inequalities in Banach spaces
• On the Clarke subdifferential of the distance function of a closed set
• New versions of Newton method: step-size choice, convergence domain and under-determined equations
• Strong Fermat rules for constrained set-valued optimization problems on Banach spaces
• Subdifferential regularities of perturbed distance functions outside the target set in Banach spaces
• A filter algorithm for nonlinear systems of equalities and inequalities

This page was built for publication: A Gauss-Newton Approach to Solving Generalized Inequalities

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