\(r\)-algorithms and ellipsoids

DOI10.1007/BF02366587zbMath0945.65062OpenAlexW2045632987MaRDI QIDQ1364116

O. Diekmann

Publication date: 18 July 2000

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

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

zbMATH Keywords

numerical experimentsellipsoid algorithmconvex programmingnonsmooth minimization\(r\)-algorithmsFejér type algorithms

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)

Related Items (9)

The generalized ellipsoid method ⋮ Method of simple-body centroids ⋮ On N. Z. Shor's three scientific ideas ⋮ Solving the dynamic optimal set partitioning problem with arrangement of centers of subsets ⋮ Interior-point algorithms: creation history, research results, applications, and prospects ⋮ Proportional packing of circles in a circular container ⋮ Sparse balanced layout of spherical voids in three-dimensional domains ⋮ Orthogonalizing linear operators in convex programming. I, II ⋮ Weak and Strong Compatibility in Data Fitting Problems Under Interval Uncertainty

Cites Work

• Convergence of \(r\)-algorithms
• An aggregate subgradient method for nonsmooth convex minimization
• Method of orthogonal descent
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: \(r\)-algorithms and ellipsoids