Facet browsing currently unavailable
Page 2 of 15819 results
Sort by: relevance publication year
Duality in mathematical programming and some problems of convex analysis JOURNAL ARTICLE published 31 October 1970 in Russian Mathematical Surveys |
Convergence analysis of iterative methods for nonsmooth convex optimization over fixed point sets of quasi-nonexpansive mappings JOURNAL ARTICLE published September 2016 in Mathematical Programming Research funded by Japan Society for the Promotion of Science (15K04763) |
Finitely convex sets of nonlinear differential equations JOURNAL ARTICLE published March 1967 in Mathematical Systems Theory |
Lifts of convex sets in optimization JOURNAL ARTICLE published October 2015 in Mathematical Programming |
Duality-based regularization in a linear convex mathematical programming problem JOURNAL ARTICLE published April 2007 in Computational Mathematics and Mathematical Physics |
Some properties of convex hulls of integer points contained in general convex sets JOURNAL ARTICLE published October 2013 in Mathematical Programming |
On a method of unconditional optimization in convex programming JOURNAL ARTICLE published January 1967 in USSR Computational Mathematics and Mathematical Physics |
Semidefinite representation of convex sets JOURNAL ARTICLE published March 2010 in Mathematical Programming |
The multiproximal linearization method for convex composite problems JOURNAL ARTICLE published July 2020 in Mathematical Programming Research funded by Air Force Office of Scientific Research (FA9550-14-1-0500) |
Two methods for minimizing convex functions in a class of nonconvex sets JOURNAL ARTICLE published October 2008 in Computational Mathematics and Mathematical Physics |
Acceleration method for convex optimization over the fixed point set of a nonexpansive mapping JOURNAL ARTICLE published February 2015 in Mathematical Programming |
Convex sets and convex cones BOOK CHAPTER published 2006 in Mathematical Programming |
An alternating linearization bundle method for convex optimization and nonlinear multicommodity flow problems JOURNAL ARTICLE published November 2011 in Mathematical Programming |
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) |
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) |
Random algorithms for convex minimization problems JOURNAL ARTICLE published October 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 |
The augmented Lagrangian method can approximately solve convex optimization with least constraint violation JOURNAL ARTICLE published July 2023 in Mathematical Programming Research funded by National Natural Science Foundation of China (11991020) | Innovative Research Group Project of the National Natural Science Foundation of China (12021001) | National Natural Science Foundation of China (11631013,11971372) |
A bundle Bregman proximal method for convex nondifferentiable minimization JOURNAL ARTICLE published 1 June 1999 in Mathematical Programming |