Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
type: Item
instance of: scholarly article
title: Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
zbMATH Open document ID: 0832.90087
DOI: 10.1007/BF01130091
author: M. B. Shchepakin
published in: Cybernetics and Systems Analysis
publication date: 1995-11-02T00:00:00Z
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 803879
zbMATH Keywords: orthogonal descent method
zbMATH Keywords: common point of a linear manifold and an arbitrary convex set
MaRDI profile type: Publication
cites work: An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
cites work: Q3323137
cites work: Q4110807
Recommended article: Q5580053
Recommended article: Optimization on Solution Sets of Common Fixed Point Problems
Recommended article: Method of orthogonal simplexes and its applications to convex programming
Recommended article: A search for common point of an arbitrary number of convex sets by using the corresponding Fejér mappings
Recommended article: Methods of solving systems of convex programming problems
Recommended article: Q3762079
Recommended article: Q5142570
Recommended article: A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems
Recommended article: ITERATIVE COMPUTATION FOR SOLVING CONVEX OPTIMIZATION PROBLEMS OVER THE SET OF COMMON FIXED POINTS OF QUASI-NONEXPANSIVE AND DEMICONTRACTIVE MAPPINGS
Recommended article: An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
description: scientific article; zbMATH DE number 803879