Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3296905
- Optimization on solution sets of common fixed point problems
- Method of orthogonal simplexes and its applications to convex programming
- A search for common point of an arbitrary number of convex sets by using the corresponding Fejér mappings
- Methods of solving systems of convex programming problems
- scientific article; zbMATH DE number 4012324
- On solution sets for convex optimization problems
- A common solution of equilibrium, constrained convex minimization and fixed point problems
- Iterative computation for solving convex optimization problems over the set of common fixed points of quasi-nonexpansive and demicontractive mappings
- An orthogonal descent algorithm to find the zero of a convex function, unsolvability test, and rate of convergence
Cites work
Cited in
(3)
This page was built for publication: Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1899543)