S. M. Stefanov

Available identifiers

zbMath Open stefanov.stefan-mMaRDI QIDQ174577

List of research outcomes

Publication	Date of Publication	Type
Separable Optimization	2021-08-24	Paper
On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory	2019-02-08	Paper
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables	2016-10-06	Paper
Convex separable minimization problems with a linear constraint and bounds on the variables	2016-04-05	Paper
https://portal.mardi4nfdi.de/entity/Q5416280	2014-05-19	Paper
https://portal.mardi4nfdi.de/entity/Q5416275	2014-05-19	Paper
Well-posedness and primal-dual analysis of some convex separable optimization problems	2013-06-07	Paper
https://portal.mardi4nfdi.de/entity/Q4904657	2013-01-31	Paper
Valid inequalities, cutting planes and integrality of the knapsack polytope	2011-11-29	Paper
Solution of some convex separable resource allocation and production planning problems with bounds on the variables	2011-06-22	Paper
Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints	2010-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q5460039	2008-05-02	Paper
Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l∞-norms	2008-04-03	Paper
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables	2007-06-11	Paper
On the solution of variational inequality problems by using cutting plane methods	2007-05-18	Paper
Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables	2007-03-27	Paper
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint	2006-05-29	Paper
Convex separable minimization problems with a linear constraint and bounded variables	2005-12-07	Paper
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)	2005-10-31	Paper
https://portal.mardi4nfdi.de/entity/Q4831691	2005-01-03	Paper
https://portal.mardi4nfdi.de/entity/Q4444573	2004-01-27	Paper
Method for solving a convex integer programming problem	2003-12-03	Paper
A Lagrangian dual method for solving variational inequalities	2003-07-22	Paper
https://portal.mardi4nfdi.de/entity/Q4793205	2003-06-09	Paper
Separable programming. Theory and methods	2001-11-05	Paper
Convex separable minimization subject to bounded variables	2001-06-26	Paper
Valid inequalities and cutting planes for some polytopes	1998-06-08	Paper

Research outcomes over time

This page was built for person: S. M. Stefanov