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

DOI10.1007/BF01131851zbMATH Open0875.90335OpenAlexW2335532264MaRDI QIDQ1816337FDOQ1816337

Authors: 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

Recommendations

• Method of orthogonal descent
• A descent algorithm for nonsmooth convex optimization
• A study on the rate of convergence of descent methods
• Convergence properties of descent methods for unconstrained minization
• Some convergence properties of descent methods

zbMATH Keywords

rate of convergenceorthogonal descent methodunsolvability test

Mathematics Subject Classification ID

Convex programming (90C25)

Cites Work

• Optimization and nonsmooth analysis
• Title not available (Why is that?)
• Title not available (Why is that?)
• Technical Note—The Nested Ball Principle for the Relaxation Method
• Title not available (Why is that?)

Cited In (6)

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

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

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