Strong uniqueness in sequential linear programming
From MaRDI portal
Publication:3494391
DOI10.1017/S0334270000006731zbMath0709.90091MaRDI QIDQ3494391
No author found.
Publication date: 1990
Published in: The Journal of the Australian Mathematical Society. Series B. Applied Mathematics (Search for Journal in Brave)
penalty functionsequential linear programmingsecond order convergence rateoptimal Kuhn-Tucker multiplier
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (10)
Error estimates and Lipschitz constants for best approximation in continuous function spaces ⋮ Sharp minima for multiobjective optimization in Banach spaces ⋮ Continuities of metric projection and geometric consequences ⋮ A Gauss-Newton method for convex composite optimization ⋮ Generalized weak sharp minima in cone-constrained convex optimization with applications ⋮ Conic positive definiteness and sharp minima of fractional orders in vector optimization problems ⋮ Global weak sharp minima for convex (semi-)infinite optimization problems ⋮ Linear-programming approach to nonconvex variational problems ⋮ Subsmooth semi-infinite and infinite optimization problems ⋮ Generalized weak sharp minima in cone-constrained convex optimization on Hadamard manifolds
This page was built for publication: Strong uniqueness in sequential linear programming
