Facet browsing currently unavailable
Page 1 of 44606 results
Sort by: relevance publication year
The relaxation method of finding the common point of convex sets and its application to the solution of problems in convex programming JOURNAL ARTICLE published January 1967 in USSR Computational Mathematics and Mathematical Physics |
The method of projections for finding the common point of convex sets JOURNAL ARTICLE published January 1967 in USSR Computational Mathematics and Mathematical Physics |
Stable sequential convex programming in a Hilbert space and its application for solving unstable problems JOURNAL ARTICLE published January 2014 in Computational Mathematics and Mathematical Physics |
Method of orthogonal simplexes and its applications to convex programming JOURNAL ARTICLE published April 2008 in Computational Mathematics and Mathematical Physics |
Finding the common point of a system of convex sets and solving mathematical-programming optimization problems by the orthogonal descent method JOURNAL ARTICLE published 1993 in Cybernetics and Systems Analysis |
A Common Solution of Equilibrium, Constrained Convex Minimization, and Fixed Point Problems JOURNAL ARTICLE published 5 February 2021 in Tamkang Journal of Mathematics |
Method for finding an approximate solution of the asphericity problem for a convex body JOURNAL ARTICLE published October 2013 in Computational Mathematics and Mathematical Physics |
APPLICATION OF E. HELLY'S THEOREM TO CONVEX PROGRAMMING, PROBLEMS OF BEST APPROXIMATION AND RELATED QUESTIONS JOURNAL ARTICLE published 28 February 1969 in Mathematics of the USSR-Sbornik |
An ε-relaxation method for separable convex cost generalized network flow problems JOURNAL ARTICLE published June 2000 in Mathematical Programming |
A Class of Nonsmooth Convex Optimization Problems BOOK CHAPTER published 2021 in Springer Optimization and Its Applications |
A general iterative algorithm for finding a common solution of equilibrium and constrained convex minimization problems JOURNAL ARTICLE published 1 April 2013 in SCIENTIA SINICA Mathematica |
A first order method for finding minimal norm-like solutions of convex optimization problems JOURNAL ARTICLE published October 2014 in Mathematical Programming |
Unbounded convex sets for non-convex mixed-integer quadratic programming JOURNAL ARTICLE published February 2014 in Mathematical Programming |
6. Applications in Convex Optimization BOOK CHAPTER published January 1994 in Interior-Point Polynomial Algorithms in Convex Programming |
A criterion for checking if a convex set belongs to the union of a finite number of convex sets JOURNAL ARTICLE published September 2009 in Computational Mathematics and Mathematical Physics |
The application of the method of Fejer approximations to the solution of problems of convex programming with non-smooth constraints JOURNAL ARTICLE published January 1969 in USSR Computational Mathematics and Mathematical Physics |
A projection and contraction method for a class of linear complementarity problems and its application in convex quadratic programming JOURNAL ARTICLE published May 1992 in Applied Mathematics & Optimization |
Conditional Gradient Method for Optimization Problems with a Constraint in the Form of the Intersection of a Convex Smooth Surface and a Convex Compact Set JOURNAL ARTICLE published July 2023 in Computational Mathematics and Mathematical Physics |
An iterative method for minimizing a convex nonsmooth function on a convex smooth surface JOURNAL ARTICLE published April 2009 in Computational Mathematics and Mathematical Physics |
Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems JOURNAL ARTICLE published January 2017 in Computational Mathematics and Mathematical Physics |