scientific article
From MaRDI portal
Publication:3998421
zbMath0713.90075MaRDI QIDQ3998421
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
stabilityregularizationconvergence ratepenalty functionssimplex methodconvex analysisaugmented Lagrangiandescent methods
Nonlinear programming (90C30) Sensitivity, stability, parametric optimization (90C31) Nonsmooth analysis (49J52) Linear programming (90C05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Solving cone-constrained convex programs by differential inclusions ⋮ Convex optimization on Banach spaces ⋮ Robust neural modeling for the cross-sectional analysis of accounting information ⋮ Approximate functions in a problem of sets separation ⋮ Conditional gradient method for optimization problems with a constraint in the form of the intersection of a convex smooth surface and a convex compact set ⋮ Well-posedness and primal-dual analysis of some convex separable optimization problems ⋮ Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set ⋮ Study of the practical convergence of evolutionary algorithms for the optimal program control of a wheeled robot ⋮ Approximate methods for convex minimization problems with series-parallel structure ⋮ Greedy approximation in convex optimization
