A new kernel function yielding the best known iteration bounds for primal-dual interior-point algorithms

Kernel functions play an important role in defining new search directions for primal-dual interior-point algorithm for solving linear optimization problems. In this paper we present a new kernel function which yields an algorithm with the best known complexity bound for both large- and small-update methods.     

The projected newton method for solving inverse eigenvalue problems - the case of multiple eigenvaues

This paper deals with the optimal solution of ill-posed linear problems, i.e..linear problems for which the solution operator is unbounded. We consider worst-case ar,and averagecase settings. Our main result is that algorithms having finite error (for a given setting) exist if and only if the solution operator is bounded (in that setting). In the worst-case setting, this means that there is no algorithm for solving ill-posed problems having finite error. In the average-case setting, this means that algorithms having finite error exist if and only lf the solution operator is bounded on the average. If the solution operator is bounded on the average, we find average-case optimal information of cardinality n and optimal algorithms using this information, and show that the average error of these algorithms tends to zero as n→∞. These results are then used to determine the [euro]-complexity, i.e., the minimal costof finding an [euro]-accurate approximation. In the worst-case setting, the [euro]comp1exity of an illposed problem is infinite for all [euro]>0; that is, we cannot find an approximation having finite error and finite cost. In the average-case setting, the [euro]-complexity of an ill-posed problem is infinite for all [euro]>0 iff the solution operator is not bounded on the average, moreover, if the the solutionoperator is bounded on the average, then the [euro]-complexity is finite for all [euro]>0.     

Computational representations of architectural design for tall buildings

Building design process is a significantly complex procedure taking into account many different factors and variables, such as the site context, environment, material availability, cost, and function. One of the most complex forms in the built environment is tall building because of the scale, design considerations, and multidisciplinary nature. This article discusses development of ontological model for understanding, presenting, relating, and managing knowledge influencing architectural design of tall buildings. Ontology is a knowledge‐based model that represents certain domain by abstraction of concepts, and a network of relationships and properties describing these concepts. By creating an architectural ontology, the factors, relations, and characteristics in the design process can be clearly defined and presented. The model incorporates physical systems such as structure, building elements, and geometry, as well as environmental effects, social aspects and other complex attributes. © 2009 Wiley Periodicals, Inc. Complexity, 2009     

On the quantifier complexity of Δ<Subscript> n+1</Subscript> (T)– induction

In this paper we continue the study of the theories I _n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that I _n+1 (T) is _n+2 –axiomatizable. In particular, I _n+1 (I _n+1 ) gives an axiomatization of Th _n+2 (I _n+1 ) and is not finitely axiomatizable. This fact relates the fragment I _n+1 (I _n+1 ) to induction rule for _n+1 –formulas. Our arguments, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for _n+2 and _n+1 formulas (see [2]).Research partially supported by grant PB96–1345 (Spanish Goverment)Mathematics Subject Classification (2000): 03F30, 03H15     

Computational Complexity in Algebraic Systems

Computability and computational complexity were first considered over the fields of real and complex numbers and generalized to arbitrary algebraic systems. This article approaches the theory of computational complexity over an arbitrary algebraic system by taking computability over the list extension for a computational model of it. We study the resultant polynomial complexity classes and mention some NP-complete problems.     

A Note on normalizations of orbit closures

We give a negative answer to a question by J. M. Landsberg on the nature of normalizations of orbit closures. A counterexample originates from the study of complex, ternary, cubic forms.     

Subword complexity of the Fibonacci–Thue–Morse sequence: The proof of Dekking’s conjecture

Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.     

Some properties of the bilevel programming problem

The purpose of this paper is to elaborate on the difficulties accompanying the development of efficient algorithms for solving the bilevel programming problem (BLPP). We begin with a pair of examples showing that, even under the best of circumstances, solutions may not exist. This is followed by a proof that the BLPP is NP-hard.This work was partially supported by a grant from the Advanced Research Program of the Texas Higher Education Coordinating Board.     

Active constraints,indefinite quadratic test problems,and complexity

The observation that at leasts constraints are active when the Hessian of the Lagrangian hass negative eigenvalues at a local minimizer is used to obtain two results: (i) a class of nearly concave quadratic minimization problem can be solved in polynomial time; (ii) a class of indefinite quadratic test problems can be constructed with a specified number of positive and negative eigenvalues and with a known global minimizer.The authors thank the reviewers for their constructive comments. The first author was supported by the National Science Foundation Grant DMS-85-20926 and by the Air Force Office of Scientific Research Grant AFOSR-ISSA-86-0091.