Investigation of optimization methods and their applications

DOI10.1007/BF01082482zbMath0487.90001OpenAlexW2029214372MaRDI QIDQ3948819

V. S. Mikhalevich, Naum Z. Shor, Ivan V. Sergienko

Publication date: 1981

Published in: Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01082482

zbMATH Keywords

surveynonsmooth optimizationdecomposition methodsrandom searchsequential optimization algorithmsInstitute of CyberneticsUkrainian Academy of Sciences

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Nonlinear programming (90C30) Stochastic programming (90C15) Differential games (aspects of game theory) (91A23) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items (3)

Optimization of computations ⋮ Solution of one problem of optimal partition of the vertex set of a hypergraph ⋮ Arithmetic modeling of random processes and \(r\)-algorithms

Uses Software

• DISPRO

Cites Work

• Family of algorithms for solving convex programming problems
• Scheduling, simulation, and optimization
• Formalization and solution of a class of discrete optimization problems
• The polynomial solvability of convex quadratic programming
• Priority intervals in ordering problems
• Validation of subgradient optimization
• The traveling-salesman problem and minimum spanning trees: Part II
• Sufficient conditions for extremum, penalty functions and regularity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Investigation of optimization methods and their applications