A Gauss-Newton Approach to Solving Generalized Inequalities
From MaRDI portal
Publication:3762088
DOI10.1287/moor.11.4.632zbMath0623.90072OpenAlexW2020061185MaRDI QIDQ3762088
No author found.
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
convergencepartial orderGauss-Newtonclosed convex coneClarke subgradientgeneralized inequalityK-regular
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items (20)
Descent methods for composite nondifferentiable optimization problems ⋮ Optimality conditions for bilevel programming problems ⋮ A parallel projection method for solving generalized linear least-squares problems ⋮ Sharp efficiency for vector equilibrium problems on Banach spaces ⋮ Weak sharp solutions for variational inequalities in Banach spaces ⋮ An Exact Penalty Method for Nonconvex Problems Covering, in Particular, Nonlinear Programming, Semidefinite Programming, and Second-Order Cone Programming ⋮ Second order sufficient optimality conditions in vector optimization ⋮ Strong Fermat rules for constrained set-valued optimization problems on Banach spaces ⋮ Numerical solution for bounding feasible point sets ⋮ Necessary conditions for weak sharp minima in cone-constrained optimization problems ⋮ Second order necessary and sufficient conditions for convex composite NDO ⋮ An algorithm for finding a solution to the inclusion 0\(\in F(x)\) ⋮ A filter algorithm for nonlinear systems of equalities and inequalities ⋮ On the Clarke subdifferential of the distance function of a closed set ⋮ NE/SQP: A robust algorithm for the nonlinear complementarity problem ⋮ Subdifferentials of perturbed distance functions in Banach spaces ⋮ Subdifferential regularities of perturbed distance functions outside the target set in Banach spaces ⋮ A robust sequential quadratic programming method ⋮ New versions of Newton method: step-size choice, convergence domain and under-determined equations ⋮ Analysis and implementation of a dual algorithm for constrained optimization
This page was built for publication: A Gauss-Newton Approach to Solving Generalized Inequalities
