Investigation of optimization methods and their applications

DOI10.1007/BF01082482MaRDI QIDQ3948819zbMATH OpenOpenAlexFDO

Authors V. S. Mikhalevich, I. V. Sergienko, N. Z. Shor

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) Nonlinear programming (90C30) Stochastic programming (90C15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Differential games (aspects of game theory) (91A23) Integer programming (90C10)

Cites work

• scientific article; zbMATH DE number 3644821 (Why is no real title available?)
• scientific article; zbMATH DE number 3679539 (Why is no real title available?)
• scientific article; zbMATH DE number 3687459 (Why is no real title available?)
• scientific article; zbMATH DE number 3700065 (Why is no real title available?)
• scientific article; zbMATH DE number 3741163 (Why is no real title available?)
• scientific article; zbMATH DE number 3765541 (Why is no real title available?)
• scientific article; zbMATH DE number 3569785 (Why is no real title available?)
• scientific article; zbMATH DE number 3619649 (Why is no real title available?)
• scientific article; zbMATH DE number 3634999 (Why is no real title available?)
• scientific article; zbMATH DE number 3282977 (Why is no real title available?)
• scientific article; zbMATH DE number 3307161 (Why is no real title available?)
• scientific article; zbMATH DE number 3324347 (Why is no real title available?)
• Family of algorithms for solving convex programming problems
• Formalization and solution of a class of discrete optimization problems
• Priority intervals in ordering problems
• Scheduling, simulation, and optimization
• Sufficient conditions for extremum, penalty functions and regularity
• The polynomial solvability of convex quadratic programming
• The traveling-salesman problem and minimum spanning trees: Part II
• Validation of subgradient optimization

Cited in

(3)

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

Describes a project that uses

Uses Software

• DISPRO

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3948819)