Bahman Kalantari  Home/Search
Context Related
| rutgers.edu/pub/dimacs/Te...9837.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/TechnicalRepor...1998 (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper first we prove four fundamental theorems of the alternative, called scaling dualities, characterizing exact and approximate solvability of four significant conic problems in finite dimensional spaces, defined as: homogeneous programming (HP), scaling problem (SP), homogeneous scaling problem (HSP), and algebraic scaling problem (ASP). Let OE be a homogeneous function of degree p ? 0, K a pointed closed convex cone, W a subspace, and F a `-logarithmically homogeneous barrier for ... (Update)
Context of citations to this paper: More
.... bounds, and the algorithms are special cases of a much more general theory on convex programming, developed by the author (see Kalantari [13]) For instance, via the scaling dualities semidefinite programming is a problem dual to a generalization of the classical trace...
.... prove the above using a property from the theory of self concordance of Nesterov and Nemirovskii [3] and a result in Kalantari [2]. The existence of this bound implies that the polynomial time potential reduction and path following algorithms which were described in [2] for...
Cited by: More
A Simple Path-Following Algorithm for the Feasibility Problem in .. - Kalantari (Correct)
A Note on a Boundedness Property of Normal Barriers of.. - Bahman Kalantari.. (Correct)
On The Arithmetic-Geometric Mean Inequality And Its.. - Bahman Kalantari (Correct)
Similar documents (at the sentence level):
47.6%: Scaling Dualities And Self-Concordant Homogeneous.. - Bahman Kalantari (1998) (Correct)
Active bibliography (related documents): More All
0.4: The Geometry and Dynamics of Data-Driven Modeling - Vixie (Correct)
0.2: A Deterministic Strongly Polynomial Algorithm for.. - Linial.. (Correct)
0.2: On Interior-Point Newton Algorithms For Discretized Optimal.. - Vicente (1998) (Correct)
Similar documents based on text: More All
0.6: The Volumetric Barrier for Semidefinite Programming - Anstreicher (1999) (Correct)
0.1: Asymptotic Normality Of Scaling Functions - Louis Chen Goodman (Correct)
0.1: Dualities Associated To Binary Operations On - Juan-Enrique Mart'inez-Legaz (Correct)
Related documents from co-citation: More All
3: Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
2: On linear programming and matrix scaling over the algebraic numbers (context) - Kalantari, Emamy-K - 1997
2: A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
BibTeX entry: (Update)
B. Kalantari, Scaling dualities and self-concordant homogeneous programming in finite dimensional spaces, Technical Report DCS-TR 359, Department of Computer Science, Rutgers University, New Brunswick, NJ, 1998. http://citeseer.ist.psu.edu/article/kalantari98scaling.html More
@techreport{ kalantari98scaling,
author = "Bahman Kalantari",
title = "Scaling Dualities and Self-Concordant Homogeneous Programming in Finite Dimensional Spaces",
number = "98-37",
month = "20,",
year = "1998",
url = "citeseer.ist.psu.edu/article/kalantari98scaling.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
663 Practical Optimization (context) - Gill, Murray et al. - 1986
640 Princeton University Press (context) - Rockafellar, Analysis - 1969
448 A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
448 A new polynomial time algorithm for linear programming (context) - Karmarkar - 1984
326 Interior-Point Polynomial Algorithms in Convex Programming (context) - Nesterov, Nemirovskii - 1994
276 Linear Programming and Extensions (context) - Dantzig - 1963
276 Semidefinite programming - Vandenberghe, Boyd - 1996
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
121 Self-scaled barriers and interior-point methods for convex p.. (context) - Nesterov, Todd - 1997
115 Introduction to Linear and Nonlinear Programming (context) - Luenberger - 1984
85 Path-following methods for linear programming (context) - Gonzaga - 1992
68 Analysis on symmetric cones (context) - Faraut, Koranyi - 1994
49 Linear and Nonlinear Programming (context) - Murty, Complementarity - 1988
46 A relationship between arbitrary positive matrices and doubl.. (context) - Sinkhorn - 1964
43 A polynomial-time algorithm based on Newton's method for lin.. (context) - Renegar - 1988
34 On projected Newton barrier methods for linear programming a.. (context) - Gill, Murray et al. - 1986
28 Barrier functions in interior point methods - Guler - 1996
28 Nonlinear Programming (context) - Fiacco, McCormick - 1968
23 Domain of positivity (context) - Rothaus - 1960
21 Cones of matrices and set-functions (context) - Lov'asz, Schrijver - 1991
17 The theory of convex homogeneous cones (context) - Vinberg - 1963
8 An extension of Karmarkar's projective algorithm for convex .. (context) - Ye, Tse - 1989
8 Ueber die Auflosung linearer Gleichungen mit reellen Coeffic.. (context) - Gordan
5 Applied Functional Analysis: Applications to Mathematical Ph.. (context) - Zeidler - 1995
5 The diagonal equivalence of a nonnegative matrix to a stocha.. (context) - Brualdi, Prater et al. - 1966
5 Derivation of a generalized and strengthened Gordan theorem .. (context) - Kalantari - 1989
5 Scaling of matrices to achieve specified row and column sums (context) - Marshall, Olkin - 1968
5 On linear programming and matrix scaling over the algebraic .. (context) - Kalantari, Emamy-K - 1997
5 Diagonal matrix scaling and linear programming (context) - Khachiyan, Kalantari - 1992
5 A Theorem of the alternative for multihomogeneous functions .. (context) - Kalantari - 1996
5 Applied Functional Analysis: Main Principles and Their Appli.. (context) - Zeidler - 1995
4 Karmarkar's algorithm with improved steps (context) - Kalantari - 1990
4 Generalization of Karmarkar's algorithm to convex homogeneou.. (context) - Kalantari - 1992
4 the complexity of nonnegative-matrix scaling (context) - Kalantari, Khachiyan - 1996
4 A simple polynomial time algorithm for a convex hull problem.. (context) - Kalantari - 1995
4 Classics in Applied Mathematics (context) - Mangasarian, Programming - 1994
3 the rate of convergence of deterministic and randomized RAS .. (context) - Kalantari, Khachiyan - 1993
3 the complexity of a class of projective interior point algor.. (context) - Goldfarb, Shaw - 1995
3 Diagonal matrix scaling is NP-hard (context) - Khachiyan - 1996
3 Optimality conditions and duality for minimizing sums of the.. (context) - Overton, Womersely - 1993
1 Positivitabereiche im (context) - Koecher - 1957
Documents on the same site (http://dimacs.rutgers.edu/TechnicalReports/1998.html): More
Quasi-Isometry Classification Of Coarse Hadamard Manifolds - Attie (1998) (Correct)
How tight is the Bollobás-Komlós conjecture - Abbasi (1998) (Correct)
On the Complexity of the Isomorphism Relation for Finitely.. - Thomas, Velickovic (1998) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC