Sign in
Facet browsing currently unavailable
Page 4 of 44737 results
Sort by: relevance publication year
|
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping JOURNAL ARTICLE published February 2015 in Mathematical Programming |
|
An ϵ-subgradient method for solving convex programming problems JOURNAL ARTICLE published January 1981 in USSR Computational Mathematics and Mathematical Physics |
|
A method of solving linear and convex programming problems JOURNAL ARTICLE published January 1970 in USSR Computational Mathematics and Mathematical Physics |
|
Methods of Chebyshev points of convex sets and their applications JOURNAL ARTICLE published January 2008 in Computational Mathematics and Mathematical Physics |
|
A new projection method for finding the closest point in the intersection of convex sets JOURNAL ARTICLE published January 2018 in Computational Optimization and Applications Research funded by Secretaría de Estado de Investigación, Desarrollo e Innovación (MTM2014-59179-C2-1-P) | Ministerio de Economía y Competitividad (RYC-2013-13327,BES-2015-073360) | Secretaría de Estado de Investigación, Desarrollo e Innovación (MTM2014-59179-C2-1-P) |
|
Convex sets and convex cones BOOK CHAPTER published 2006 in Mathematical Programming |
|
Convergence of the gradient projection method and Newton’s method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set JOURNAL ARTICLE published October 2016 in Computational Mathematics and Mathematical Physics |
|
Diagonals of convex sets JOURNAL ARTICLE published 1978 in Czechoslovak Mathematical Journal |
|
Numerical optimization method for packing regular convex polygons JOURNAL ARTICLE published August 2016 in Computational Mathematics and Mathematical Physics |
|
CONVEX FUNCTIONS OCCURRING IN VARIATIONAL PROBLEMS AND THE ABSOLUTE MINIMUM PROBLEM JOURNAL ARTICLE published 28 February 1972 in Mathematics of the USSR-Sbornik |
|
Status determination by interior-point methods for convex optimization problems in domain-driven form JOURNAL ARTICLE published July 2022 in Mathematical Programming Research funded by Office of Naval Research (N00014-18-1-2078) | Office of Naval Research (N00014-15-1-2171) | Office of Naval Research (N00014-12-1-0049) |
|
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems JOURNAL ARTICLE published November 2011 in Mathematical Programming |
|
Nearly convex sets: fine properties and domains or ranges of subdifferentials of convex functions JOURNAL ARTICLE published November 2016 in Mathematical Programming |
|
Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems JOURNAL ARTICLE published January 2021 in Mathematical Programming |
|
On lower iteration complexity bounds for the convex concave saddle point problems JOURNAL ARTICLE published July 2022 in Mathematical Programming Research funded by National Science Foundation (CMMI-172775 and CIF-1910385) |
|
Computational Efficiency of the Simplex Embedding Method in Convex Nondifferentiable Optimization JOURNAL ARTICLE published February 2018 in Computational Mathematics and Mathematical Physics |
|
Random algorithms for convex minimization problems JOURNAL ARTICLE published October 2011 in Mathematical Programming |
|
A modified Halpern algorithm for approximating a common solution of split equality convex minimization problem and fixed point problem in uniformly convex Banach spaces JOURNAL ARTICLE published June 2019 in Computational and Applied Mathematics |
|
Chapter X Relaxation of Non-convex Variational Problems (II) BOOK CHAPTER published 1976 in Convex Analysis and Variational Problems |
|
Chapter IX Relaxation of Non-convex variational Problems (I) BOOK CHAPTER published 1976 in Convex Analysis and Variational Problems |