Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Numerical analysis of the orthogonal descent method

From MaRDI portal
Publication:1905135
Jump to:navigation, search

DOI10.1007/BF02366430zbMath0838.90099MaRDI QIDQ1905135

V. A. Skokov, M. B. Shchepakin

Publication date: 8 January 1996

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


zbMATH Keywords

nonsmooth optimizationorthogonal descent method


Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonsmooth analysis (49J52)


Related Items

Orthogonalizing linear operators in convex programming. I, II



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Test examples for nonlinear programming codes
  • An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
  • Orthogonal descent to a convex set in a linear manifold
  • Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
  • Method of orthogonal descent
Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1905135&oldid=14320253"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 15:09.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki