Access the full text.
Sign up today, get DeepDyve free for 14 days.
Y. Genin, Y. Hachez, Y. Nesterov, P. Dooren (2003)
Optimization Problems over Positive Pseudopolynomial MatricesSIAM J. Matrix Anal. Appl., 25
N. Biggs, M. Hoare (1983)
The sextet construction for cubic graphsCombinatorica, 3
Y. Genin, Y. Hachez, Y. Nesterov, P. Dooren (2000)
Convex optimization over positive polynomials and filter design
L. Faybusovich (2002)
Self-Concordant Barriers for Cones Generated by Chebyshev SystemsSIAM J. Optim., 12
B. Rosenfeld (1997)
Algebras and Lie Groups
A. Lubotzky (1994)
Discrete groups, expanding graphs and invariant measures, 125
F. Lazebnik, V. Ustimenko, A. Woldar (1995)
A new series of dense graphs of high girthBulletin of the American Mathematical Society, 32
A. Lubotzky (1995)
Cayley graphs: eigenvalues, expanders and random walks
J. A. Thas (1995)
Handbook on Incidence Geometry
V. A. Ustimenko (1991)
Linear interpretation of Chevalley group flag geometriesUkraine Math. J., 43
(2000)
Convex optimization problems involving nite autocorrelation sequences, technical report
V. Ustimenko (1994)
On Some Properties of Geometries of Chevalley Groups and Their Generalizations
V. A. Ustimenko (1998)
On the varieties of parabolic subgroups, their generalizations and combina-torial applicationsActa Appl. Math., 52
Moshe Morgenstern (1994)
Existence and Explicit Constructions of q + 1 Regular Ramanujan Graphs for Every Prime Power qJ. Comb. Theory, Ser. B, 62
J. Tits (1960)
Les groupes simples de Suzuki et de Ree, 6
A. Brouwer, A. Cohen, A. Neumaier (1989)
Distance Regular Graphs
D. Stanton (1983)
Generalized polygons and Chebychev polynomialsJ. Combin. Theory A, 34
B. Bollobás (1978)
Extremal Graph Theory
A. Brouwer, F. Clerck (1993)
The complement of a geometric hyperplane in a generalized polygon is usually connected
N. Koblitz (1998)
Algebraic aspects of cryptography, 3
W. Imrich (1984)
Explicit construction of regular graphs without small cyclesCombinatorica, 4
C. Shannon (1949)
Communication theory of secrecy systemsBell Syst. Tech. J., 28
J. Tits (1959)
Sur la trialité et certains groupes qui s'en déduisentPubl. Math. IHES, 2
S. Landau (2000)
Standing the Test of Time : The Data Encryption Standard, 47
G. Margulis (1982)
Explicit constructions of graphs without short cycles and low density codesCombinatorica, 2
W. Imrich (1984)
Explicit construction of graphs without small cyclesCombinatorica, 2
R. Carter, I. MacDonald, Graeme Segal, M. Taylor (1995)
Lectures on Lie Groups and Lie Algebras: Simple groups of Lie type
N. Biggs, A. Boshier (1990)
Note on the girth of Ramanujan graphsJ. Comb. Theory, Ser. B, 49
J. Tits (1959)
Sur la trialité et certains groupes qui s’en déduisentPublications Mathématiques de l'Institut des Hautes Études Scientifiques, 2
A. Lubotsky, R. Philips, P. Sarnak (1989)
Ramanujan graphsJ. Combin. Theory, 115
Y. Nesterov (2000)
Squared Functional Systems and Optimization Problems
R.W. Carter (1972)
Simple Groups of Lie Type
V. Ustimenko, A. Woldar (2003)
Extremal properties of regular and affine generalized m-gons as tactical configurationsEur. J. Comb., 24
N. L. Biggs (1988)
Graphs with large girthArs Combin.C, 25
A. Valette (1996)
Graphes de Ramanujan et applicationsSeminaire Bourbak, 829
(1970)
Convex analysis
G. Margulis (1975)
Explicit constructions of concentratorsProblems Inform. Transmissions, 10
N. Akhiezer, M. Krein (1962)
Some questions in the theory of moments
F. Lazebnik, V. Ustimenko (1993)
Discrete Math. Theor. Comput. Sci.
V. A. Ustimenko (1990)
Questions of Group Theory and Homological Algebra
F. Lazebnik, V. Ustimenko, A. Woldar (1996)
A characterization of the components of the graphs D(k, q)Discret. Math., 157
M. Krein, D. Louvish, A. Nudel’man (1977)
The Markov Moment Problem and Extremal Problems
M. Simonovitz (1983)
Selected Topics in Graph Theory
J.P. Serre (1974)
Lie Algebras and Lie Groups
F. Lazebnik, V. Ustimenko (1995)
Explicit Construction of Graphs with an Arbitrary Large Girth and of Large SizeDiscret. Appl. Math., 60
(1982)
Matrix polynomials
N. Koblitz (1987)
A Course in Number Theory and Cryptography
V. Ustimenko (1992)
Investigation in Algebraic Theory of Combinatorial Objects
V. Ustimenko (2001)
CRYPTIM: Graphs as Tools for Symmetric Encryption
W. Magnus, A. Karrass, D. Solitar (1966)
Combinatorial Group Theory
T. Davidson, Z. Luo, J. Sturm (2001)
Linear matrix inequality formulation of spectral mask constraints2001 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.01CH37221), 6
A. Weiss (1984)
Girths of bipartite sextet graphsCombinatorica, 4
J. Bondy, M. Simonovits (1974)
Cycles of even length in graphsJournal of Combinatorial Theory, Series B, 16
Y. Nesterov, A. Nemirovski (1994)
Interior-point polynomial algorithms in convex programming, 13
We generalize Nesterov's construction for the reduction of various classes of semi-infinite programming problems to the semidefinite programming form. In this way, we are able to consider ‘cones of squares’ of real-valued and matrix-valued functions as rather particular cases of a unifying abstract scheme. We also interpret from this viewpoint some results of M. Krein and A. Nudelman. This provides (in a way which probably has not been anticipated by these authors) a very powerful tool for solving various optimization problems.
Acta Applicandae Mathematicae – Springer Journals
Published: Oct 10, 2004
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.