Projects
Reading
People
Chat
SU\G
(đ¸)
/K¡U
Projects
Reading
People
Chat
Sign Up
Light
Dark
System
Stefan M. Stefanov
Follow
Share
Generating author description...
All published works
Action
Title
Year
Authors
+
Numerical solution of box constrained separable convex quadratic programming problems
2024
Stefan M. Stefanov
+
Linear programming problems and matrix games
2024
Stefan M. Stefanov
+
On the solution of two-person zero-sum matrix games
2024
Stefan M. Stefanov
+
On the solution of quadratic programming problems
2023
Stefan M. Stefanov
+
On some properties of linear functionals
2022
Stefan M. Stefanov
+
Numerical solution of systems of non linear equations defined by convex functions
2021
Stefan M. Stefanov
+
Numerical solution of some systems of nonlinear algebraic equations
2021
Stefan M. Stefanov
+
Extensions
2021
Stefan M. Stefanov
+
Convex Separable Programming
2021
Stefan M. Stefanov
+
Applications of Convex Separable Unconstrained Nondifferentiable Optimization to Approximation Theory
2021
Stefan M. Stefanov
+
Version Two: Linear Constraint of the Form â$$\ge $$â
2021
Stefan M. Stefanov
+
Theorems of the alternative revisited
2019
Stefan M. Stefanov
+
On the inverse interpolation and some of its applications
2019
Stefan M. Stefanov
+
On the Cauchy-Schwarz inequality approach for solving a quadratic optimization problem
2019
Stefan M. Stefanov
+
Applications of Iterative Nondifferentiable Optimization to Some Engineering Approximation Problems
2018
Stefan M. Stefanov
+
On the solution of quadratic programming problem with a feasible region defined as a Minkowski sum of a compact set and finitely generated convex closed cone
2018
Stefan M. Stefanov
+
Strictly convex separable optimization with linear equality constraints and bounded variables
2018
Stefan M. Stefanov
+
PDF
Chat
On the Application of Iterative Methods of Nondifferentiable Optimization to Some Problems of Approximation Theory
2014
Stefan M. Stefanov
+
Lagrangian dual methods for variational inequalities
2013
Stefan M. Stefanov
+
PDF
Chat
Well-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems
2013
Stefan M. Stefanov
+
Solution of some convex separable resource allocation and production planning problems with bounds on the variables
2010
Stefan M. Stefanov
+
Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
2009
Stefan M. Stefanov
+
PDF
Chat
Convex separable minimization with box constraints
2007
Stefan M. Stefanov
+
Applications of convex separable unconstrained nonsmooth optimization to numerical approximation with respect to l<sub>1</sub>- and l<sub>â</sub>-norms
2007
Stefan M. Stefanov
+
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
2006
Stefan M. Stefanov
+
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
2006
Stefan M. Stefanov
+
PDF
Chat
Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
2006
Stefan M. Stefanov
+
PDF
Chat
Convex separable minimization problems with a linear constraint and bounded variables
2005
Stefan M. Stefanov
+
PDF
Chat
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints inân
2004
Stefan M. Stefanov
+
PDF
Chat
None
2004
Stefan M. Stefanov
+
PDF
Chat
A Lagrangian dual method for solving variational inequalities
2002
Stefan M. Stefanov
+
Approximations with Respect to â1 and ââ-Norms: An Application of Convex Separable Unconstrained Nondifferentiable Optimization
2001
Stefan M. Stefanov
+
Preliminaries: Convex Analysis and Convex Programming
2001
Stefan M. Stefanov
+
Well-Posedness of Optimization Problems. On the Stability of the Set of Saddle Points of the Lagrangian
2001
Stefan M. Stefanov
+
Version Two: Linear Constraint of the Form ââĽâ
2001
Stefan M. Stefanov
+
Convex Separable Programming
2001
Stefan M. Stefanov
+
Statement of the Main Problem. Basic Result
2001
Stefan M. Stefanov
+
Introduction. Approximating the Separable Problem
2001
Stefan M. Stefanov
+
Version One: Linear Equality Constraints
2001
Stefan M. Stefanov
Common Coauthors
Coauthor
Papers Together
Commonly Cited References
Action
Title
Year
Authors
# of times referenced
+
A polynomially bounded algorithm for a singly constrained quadratic program
1980
Richard V. Helgason
Jeffery L. Kennington
H. Lall
8
+
Convex quadratic programming with one constraint and bounded variables
1986
JeanâPierre Dussault
Jacques A. Ferland
B. Lemaire
8
+
PDF
Chat
None
2004
Stefan M. Stefanov
7
+
PDF
Chat
Convex separable minimization problems with a linear constraint and bounded variables
2005
Stefan M. Stefanov
6
+
PDF
Chat
Well-Posedness and Primal-Dual Analysis of Some Convex Separable Optimization Problems
2013
Stefan M. Stefanov
6
+
PDF
Chat
Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints inân
2004
Stefan M. Stefanov
5
+
An Efficient Newton Barrier Method for Minimizing a Sum of Euclidean Norms
1996
Knud D. Andersen
4
+
A finite algorithm for finding the projection of a point onto the canonical simplex of ? n
1986
Christian Michelot
4
+
The Theory of Search: Optimum Distribution of Search Effort
1958
A. Charnes
W. W. Cooper
4
+
Numerical Methods for Least Squares Problems
1996
Ă ke BjĂśrck
4
+
Solving Least Squares Problems
1995
C. L. Lawson
Richard Hanson
4
+
Algorithms for bound constrained quadratic programming problems
1989
Jorge J. Morďż˝
Gerardo Toraldo
4
+
PDF
Chat
Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
2006
Stefan M. Stefanov
3
+
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
1997
Guoliang Xue
Yinyu Ye
3
+
Algorithms for the solution of quadratic knapsack problems
1991
PĂŁnos M. Pardalos
Yinyu Ye
Chi-Geun Han
3
+
Solution of some convex separable resource allocation and production planning problems with bounds on the variables
2010
Stefan M. Stefanov
3
+
PDF
Chat
A Globally Convergent Method for $l_p $ Problems
1993
Yuying Li
3
+
An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
1990
PĂŁnos M. Pardalos
Nainan Kovoor
3
+
Minimizing a convex separable exponential function subject to linear equality constraint and bounded variables
2006
Stefan M. Stefanov
3
+
PDF
Chat
On the Application of Iterative Methods of Nondifferentiable Optimization to Some Problems of Approximation Theory
2014
Stefan M. Stefanov
3
+
A Quasi-Newton Approach to Nonsmooth Convex Optimization Problems in Machine Learning
2010
Jin Yu
S. V. N. Vishwanathan
Simon GĂźnter
Nicol N. Schraudolph
3
+
The long-step method of analytic centers for fractional problems
1997
Arkadi Nemirovski
2
+
Quasi-Newton Updates with Bounds
1987
Paul H. Calamai
Jorge J. Morè
2
+
PDF
Chat
A Global and Quadratically Convergent Method for Linear $l_\infty $ Problems
1992
Thomas F. Coleman
Yuying Li
2
+
A globally convergent Newton method for solving strongly monotone variational inequalities
1993
Kouichi Taji
Masao Fukushima
Toshihide Ibaraki
2
+
Equivalence of variational inequality problems to unconstrained minimization
1997
Jiming Peng
2
+
Conditions ensuring the applicability of cutting-plane methods for solving variational inequalities
2000
Jean-Pierre Crouzeix
Patrice Marcotte
Daoli Zhu
2
+
On Maximizing a Sum of Ratios
1989
Alberto Cambini
Laura Martein
Siegfried Schaible
2
+
A note on a globally convergent Newton method for solving monotone variational inequalities
1987
Patrice Marcotte
JeanâPierre Dussault
2
+
Convex dual for quadratic concave fractional programs
1996
C. H. Scott
T. R. Jefferson
2
+
A globally and quadratically convergent affine scaling method for linearâ 1 problems
1992
Thomas F. Coleman
Yuying Li
2
+
Algorithms for generalized fractional programming
1991
Jean-Pierre Crouzeix
Jacques A. Ferland
2
+
Smoothing of mixed complementarity problems
1995
Steven A. Gabriel
Jorge J. Morè
2
+
Generalized convex duality for multiobjective fractional programs
1991
R.N. Mukherjee
2
+
An interior-point method for generalized linear-fractional programming
1995
Yu. E. Nesterov
Arkadi Nemirovski
2
+
An Efficient Algorithm for Discrete $l_1$ Linear Approximation with Linear Constraints
1978
I. Barrodale
F. D. K. Roberts
2
+
An Algorithm for solving the Integer Linear Fractional Programs
1993
Omar M. Saad
2
+
PDF
Chat
A Truly Globally Convergent Newton-Type Method for the Monotone Nonlinear Complementarity Problem
2000
M. V. Solodov
B. F. Svaiter
2
+
Fractional programming: Applications and algorithms
1981
Siegfried Schaible
2
+
A subgradient algorithm for certain minimax and minisum problems
1978
Jacques Chatelon
Donald W. Hearn
Timothy J. Lowe
2
+
Unconstrained Optimization Reformulations of Variational Inequality Problems
1997
N. Yamashita
K. Taji
Masao Fukushima
2
+
Reformulation of Variational Inequalities on a Simplex and Compactification of Complementarity Problems
2000
Roberto Andreani
J. M. MartÄąĚnez
2
+
Beyond Monotonicity in Regularization Methods for Nonlinear Complementarity Problems
1999
Francisco Facchinei
Christian Kanzow
2
+
Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
1996
Asen L. Dontchev
R. T. Rockafellar
2
+
A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
2000
Hou-Duo Qi
2
+
An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
2006
Stefan M. Stefanov
2
+
Minimization Techniques for Piecewise Differentiable Functions: The $l_1$ Solution to an Overdetermined Linear System
1978
Richard H. Bartels
Andrew R. Conn
James W. Sinclair
2
+
Optimization and Nonsmooth Analysis
1990
Frank H. Clarke
2
+
PDF
Chat
Fractional programming duality via geometric programming duality
1980
C. H. Scott
T. R. Jefferson
2
+
Asymptotic Analysis for Penalty and Barrier Methods in Convex and Linear Programming
1997
A. Auslender
Roberto Cominetti
Mounir Haddou
2