scientific article; zbMATH DE number 2096252

zbMath1055.65075MaRDI QIDQ4810210

Alexey F. Izmailov, Mikhail V. Solodov

Publication date: 1 September 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

convergencenumerical examplestextbooksubgradient methodNewton methodspenalty methodstrust-region methoddescent methodsline search methodsgradient-type algorithmsconjugate directions methodfinite-dimensional nonlinear optimizationcutting-planes method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Research exposition (monographs, survey articles) pertaining to numerical analysis (65-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Mathematical programming (90Cxx)

Related Items (13)

On the problem polyhedral separability: a numerical solution ⋮ Nonlinear parametric identification of stochastic discrete plants based on generalized probabilistic criteria ⋮ Mathematical methods for computing the extremal power values in the nodes of AC electric power systems ⋮ Newton-type methods for constrained optimization with nonregular constraints ⋮ Refinement of Lagrangian bounds in optimization problems ⋮ Defining systems and Newton-like methods for finding singular solutions to nonlinear boundary value problems ⋮ Convergence rate estimates for penalty methods revisited ⋮ On estimates for solutions of systems of convex inequalities ⋮ On necessary extremum conditions for finite-dimensional problems with inequality constraints ⋮ A solution of the problem of nonlinear parametric identification based on generalized probability criteria ⋮ Recommendation generation algorithms for scheduling of data exchange through a channel with centralized control ⋮ On a method of nonlinear optimization for the comparison of spatial structure of molecules ⋮ Gradient methods for nonstationary unconstrained optimization problems

This page was built for publication: