Stefan M. Stefanov

From MaRDI portal
Person:174577

Available identifiers

zbMath Open stefanov.stefan-mMaRDI QIDQ174577

List of research outcomes

PublicationDate of PublicationType
Separable Optimization2021-08-24Paper
On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory2019-02-08Paper
On the solution of multidimensional convex separable continuous knapsack problem with bounded variables2016-10-06Paper
https://portal.mardi4nfdi.de/entity/Q27973022016-04-05Paper
https://portal.mardi4nfdi.de/entity/Q54162752014-05-19Paper
https://portal.mardi4nfdi.de/entity/Q54162802014-05-19Paper
Well-posedness and primal-dual analysis of some convex separable optimization problems2013-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49046572013-01-31Paper
Valid inequalities, cutting planes and integrality of the knapsack polytope2011-11-29Paper
Solution of some convex separable resource allocation and production planning problems with bounds on the variables2011-06-22Paper
Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints2010-05-14Paper
https://portal.mardi4nfdi.de/entity/Q54600392008-05-02Paper
Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l1- and l-norms2008-04-03Paper
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables2007-06-11Paper
On the solution of variational inequality problems by using cutting plane methods2007-05-18Paper
Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables2007-03-27Paper
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint2006-05-29Paper
Convex separable minimization problems with a linear constraint and bounded variables2005-12-07Paper
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)2005-10-31Paper
https://portal.mardi4nfdi.de/entity/Q48316912005-01-03Paper
https://portal.mardi4nfdi.de/entity/Q44445732004-01-27Paper
Method for solving a convex integer programming problem2003-12-03Paper
A Lagrangian dual method for solving variational inequalities2003-07-22Paper
https://portal.mardi4nfdi.de/entity/Q47932052003-06-09Paper
Separable programming. Theory and methods2001-11-05Paper
Convex separable minimization subject to bounded variables2001-06-26Paper
Valid inequalities and cutting planes for some polytopes1998-06-08Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Stefan M. Stefanov