On N. Z. Shor's three scientific ideas

DOI10.1007/s10559-012-9387-xzbMath1306.90153OpenAlexW1975676975MaRDI QIDQ380646

Petro I. Stetsyuk, Ivan V. Sergienko

Publication date: 14 November 2013

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-012-9387-x

zbMATH Keywords

subgradient methodnondifferentiable optimization\(r\)-algorithmdual estimateellipsoid methodfunctionally redundant constraintsquadratic extremum problemspace dilation operator

Mathematics Subject Classification ID

Nonlinear programming (90C30) Biographies, obituaries, personalia, bibliographies (01A70)

Related Items (9)

Strong deviation theorems for general information sources ⋮ Three-way multi-attribute decision making under incomplete mixed environments using probabilistic similarity ⋮ Interior-point algorithms: creation history, research results, applications, and prospects ⋮ Digital model of natural cores using geometric design ⋮ Constructing the external contour of the Frankl nozzle using S-shaped curves with quadratic distribution of the curvature ⋮ Theory and software implementations of Shor's \(r\)-algorithms ⋮ Sparse balanced layout of spherical voids in three-dimensional domains ⋮ Open-loop solvability for mean-field stochastic linear quadratic optimal control problems of Markov regime-switching system ⋮ Lattice coverage of cuboid with minimum number of hemispheres

Uses Software

• SolvOpt

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Models and information technologies for decision support during structural and technological changes
• Geometric algorithms and combinatorial optimization
• Orthogonalizing linear operators in convex programming. I, II
• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• \(r\)-algorithms and ellipsoids
• Nondifferentiable optimization and polynomial problems
• An implementation of Shor's \(r\)-algorithm
• Lagrangian bounds in multiextremal polynomial and discrete optimization problems
• Algorithms of nondifferentiable optimization: development and application
• Fejer algorithms with an adaptive step
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Method of obtaining estimates in quadratic extremal problems with Boolean variables
• Class of global minimum bounds of polynomial functions
• An approach to obtaining global extremums in polynomial mathematical programming problems

This page was built for publication: On N. Z. Shor's three scientific ideas