An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence

DOI10.1007/BF01131851zbMath0875.90335OpenAlexW2335532264MaRDI QIDQ1816337

M. B. Shchepakin

Publication date: 20 January 1997

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

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

zbMATH Keywords

rate of convergenceorthogonal descent methodunsolvability test

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (5)

A modified orthogonal-descent algorithm for finding the zero of a complex function ⋮ Symmetric constraints in classification problems that permit replacement by functional constraints ⋮ Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method ⋮ Numerical analysis of the orthogonal descent method ⋮ Orthogonal descent to a convex set in a linear manifold

Cites Work

• Technical Note—The Nested Ball Principle for the Relaxation Method
• Optimization and nonsmooth analysis
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence