scientific article

zbMath0593.49001MaRDI QIDQ3723176

Leonid Viktorovich Vasil'Ev, V. F. Dem'yanov

Publication date: 1985

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

zbMATH Keywords

convex analysisconstrained minimizationsubgradient methodsquasidifferentiable functionsunconstrained optimization of nonsmooth functions

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30) Fréchet and Gateaux differentiability in optimization (49J50) Numerical methods based on nonlinear programming (49M37) Methods involving semicontinuity and convergence; relaxation (49J45) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Continuity and differentiation questions (26B05) Convexity of real functions of several variables, generalizations (26B25) Methods of reduced gradient type (90C52) Methods of successive quadratic programming type (90C55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items (20)

Analytic-numerical approach to construction of minimax solution to the Hamilton-Jacobi equation in three-dimensional space ⋮ On an Inner Estimate of a Convex Body by the Lebesgue Set of Convex Differentiable Function ⋮ On numerical solving the spherical separability problem ⋮ Distance between strongly and weakly convex sets ⋮ On the problem of minimizing a difference of polyhedral convex functions under linear constraints ⋮ Global optimality conditions in nonconvex optimization ⋮ Comparison between quasidifferentials and exhausters ⋮ Incremental subgradient algorithms with dynamic step sizes for separable convex optimizations ⋮ Directional differentiability, coexhausters, codifferentials and polyhedral DC functions ⋮ A cutting plane method for solving KYP-SDPs ⋮ On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory ⋮ Algorithms of optimal ball packing into ellipsoids ⋮ Application of extreme sub- and epiarguments, convex and concave envelopes to search for global extrema ⋮ Alternance Form of Optimality Conditions in the Finite-Dimensional Space ⋮ Weak invariance of a cylindrical set with smooth boundary with respect to a control system ⋮ A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Quasidifferential modelling of adhesive contact. ⋮ Machine learning algorithms of relaxation subgradient method with space extension

This page was built for publication: