Orthogonal packing of identical rectangles within isotropic convex regions

A mixed integer continuous nonlinear model and a solution method for the problem of orthogonally packing identical rectangles within an arbitrary convex region are introduced in the present work. The convex region is assumed to be made of an isotropic material in such a way that arbitrary rotations of the items, preserving the orthogonality constraint, are allowed. The solution method is based on a combination of branch and bound and active-set strategies for bound-constrained minimization of smooth functions. Numerical results show the reliability of the presented approach. (C) 2010 Elsevier Ltd. All rights reserved.

Algorithms for Maximum Independent Set in Convex Bipartite Graphs

A bipartite graph G = (V, W, E) is convex if there exists an ordering of the vertices of W such that, for each v. V, the neighbors of v are consecutive in W. We describe both a sequential and a BSP/CGM algorithm to find a maximum independent set in a convex bipartite graph. The sequential algorithm improves over the running time of the previously known algorithm and the BSP/CGM algorithm is a parallel version of the sequential one. The complexity of the algorithms does not depend on |W|.

The C(K, X) spaces for compact metric spaces K and X with a uniformly convex maximal factor

In this paper, we prove that if a Banach space X contains some uniformly convex subspace in certain geometric position, then the C(K, X) spaces of all X-valued continuous functions defined on the compact metric spaces K have exactly the same isomorphism classes that the C(K) spaces. This provides a vector-valued extension of classical results of Bessaga and Pelczynski (1960) [2] and Milutin (1966) [13] on the isomorphic classification of the separable C(K) spaces. As a consequence, we show that if 1 < p < q < infinity then for every infinite countable compact metric spaces K(1), K(2), K(3) and K(4) are equivalent: (a) C(K(1), l(p)) circle plus C(K(2), l(q)) is isomorphic to C(K(3), l(p)) circle plus (K(4), l(q)). (b) C(K(1)) is isomorphic to C(K(3)) and C(K(2)) is isomorphic to C(K(4)). (C) 2011 Elsevier Inc. All rights reserved.

Home range and habitat use by the roadside hawk, Rupornis magnirostris (Gmelin, 1788) (Aves: Falcaniformes) in southeastern Brazil

Although most raptor species are found mainly in the tropics, information on their home range and spatial requirements in the Neotropics is still scarce. In this study, we used radio telemetry to evaluate the home range and the habitat use and selection of five Roadside hawks, Rupornis magnirostris (Gmelin, 1788) in a heterogeneous landscape in southeastern Brazil. The average home range size calculated using the adaptive kernel method (95% isopleth) was 126.1ha (47.4-266.7ha), but using the minimum convex polygon method (95% isopleth) it was 143.54ha (32.6-382.3ha). The roadside hawk explored a wide variety of habitats, most of them opportunistically, as suggested in the literature. Despite this, habitat quality could influence home range size and promote habitat selection. The observation of habitat use as expected, as well as the relatively small home range size, could be related to the generalist/opportunistic behaviour of the roadside hawk.

Morphology and phylogenetic relationships of a remarkable new genus and two new species of Neotropical freshwater stingrays from the Amazon basin (Chondrichthyes: Potamotrygonidae)

The morphology and phylogenetic relationships of a new genus and two new species of Neotropical freshwater stingrays, family Potamotrygonidae, are investigated and described in detail. The new genus, Heliotrygon, n. gen., and its two new species, Heliotrygon gomesi, n. sp. (type-species) and Heliotrygon rosai, n. sp., are compared to all genera and species of potamotrygonids, based on revisions in progress. Some of the derived features of Heliotrygon include its unique disc proportions (disc highly circular, convex anteriorly at snout region, its width and length very similar), extreme subdivision of suborbital canal (forming a complex honeycomb-like pattern anterolaterally on disc), stout and triangular pelvic girdle, extremely reduced caudal sting, basibranchial copula with very slender and acute anterior extension, and precerebral and frontoparietal fontanellae of about equal width, tapering very little posteriorly. Both new species can be distinguished by their unique color patterns: Heliotrygon gomesi is uniform gray to light tan or brownish dorsally, without distinct patterns, whereas Heliotrygon rosai is characterized by numerous white to creamy-white vermiculate markings over a light brown, tan or gray background color. Additional proportional characters that may further distinguish both species are also discussed. Morphological descriptions are provided for dermal denticles, ventral lateral-line canals, skeleton, and cranial, hyoid and mandibular muscles of Heliotrygon, which clearly corroborate it as the sister group of Paratrygon. Both genera share numerous derived features of the ventral lateral-line canals, neurocranium, scapulocoracoid, pectoral basals, clasper morphology, and specific patterns of the adductor mandibulae and spiracularis medialis muscles. Potamotrygon and Plesiotrygon are demonstrated to share derived characters of their ventral lateral-line canals, in addition to the presence of angular cartilages. Our morphological phylogeny is further corroborated by a molecular phylogenetic analysis of cytochrome b based on four sequences (637 base pairs in length), representing two distinct haplotypes for Heliotrygon gomesi. Parsimony analysis produced a single most parsimonious tree revealing Heliotrygon and Paratrygon as sister taxa (boot-strap proportion of 70%), which together are the sister group to a clade including Plesiotrygon and species of Potamotrygon. These unusual stingrays highlight that potamotrygonid diversity, both in terms of species composition and undetected morphological and molecular patterns, is still poorly known.

New and improved results for packing identical unitary radius circles within triangles, rectangles and strips

The focus of study in this paper is the class of packing problems. More specifically, it deals with the placement of a set of N circular items of unitary radius inside an object with the aim of minimizing its dimensions. Differently shaped containers are considered, namely circles, squares, rectangles, strips and triangles. By means of the resolution of non-linear equations systems through the Newton-Raphson method, the herein presented algorithm succeeds in improving the accuracy of previous results attained by continuous optimization approaches up to numerical machine precision. The computer implementation and the data sets are available at http://www.ime.usp.br/similar to egbirgin/packing/. (C) 2009 Elsevier Ltd, All rights reserved.

Proximal methods for nonlinear programming: double regularization and inexact subproblems

This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

Second-order negative-curvature methods for box-constrained and general constrained optimization

A Nonlinear Programming algorithm that converges to second-order stationary points is introduced in this paper. The main tool is a second-order negative-curvature method for box-constrained minimization of a certain class of functions that do not possess continuous second derivatives. This method is used to define an Augmented Lagrangian algorithm of PHR (Powell-Hestenes-Rockafellar) type. Convergence proofs under weak constraint qualifications are given. Numerical examples showing that the new method converges to second-order stationary points in situations in which first-order methods fail are exhibited.

Minimizing the object dimensions in circle and sphere packing problems

Given a fixed set of identical or different-sized circular items, the problem we deal with consists on finding the smallest object within which the items can be packed. Circular, triangular, squared, rectangular and also strip objects are considered. Moreover, 2D and 3D problems are treated. Twice-differentiable models for all these problems are presented. A strategy to reduce the complexity of evaluating the models is employed and, as a consequence, instances with a large number of items can be considered. Numerical experiments show the flexibility and reliability of the new unified approach. (C) 2007 Elsevier Ltd. All rights reserved.

Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization

Augmented Lagrangian methods for large-scale optimization usually require efficient algorithms for minimization with box constraints. On the other hand, active-set box-constraint methods employ unconstrained optimization algorithms for minimization inside the faces of the box. Several approaches may be employed for computing internal search directions in the large-scale case. In this paper a minimal-memory quasi-Newton approach with secant preconditioners is proposed, taking into account the structure of Augmented Lagrangians that come from the popular Powell-Hestenes-Rockafellar scheme. A combined algorithm, that uses the quasi-Newton formula or a truncated-Newton procedure, depending on the presence of active constraints in the penalty-Lagrangian function, is also suggested. Numerical experiments using the Cute collection are presented.

Improving ultimate convergence of an augmented Lagrangian method

Optimization methods that employ the classical Powell-Hestenes-Rockafellar augmented Lagrangian are useful tools for solving nonlinear programming problems. Their reputation decreased in the last 10 years due to the comparative success of interior-point Newtonian algorithms, which are asymptotically faster. In this research, a combination of both approaches is evaluated. The idea is to produce a competitive method, being more robust and efficient than its `pure` counterparts for critical problems. Moreover, an additional hybrid algorithm is defined, in which the interior-point method is replaced by the Newtonian resolution of a Karush-Kuhn-Tucker (KKT) system identified by the augmented Lagrangian algorithm. The software used in this work is freely available through the Tango Project web page:http://www.ime.usp.br/similar to egbirgin/tango/.

Augmented Lagrangian methods under the constant positive linear dependence constraint qualification

Two Augmented Lagrangian algorithms for solving KKT systems are introduced. The algorithms differ in the way in which penalty parameters are updated. Possibly infeasible accumulation points are characterized. It is proved that feasible limit points that satisfy the Constant Positive Linear Dependence constraint qualification are KKT solutions. Boundedness of the penalty parameters is proved under suitable assumptions. Numerical experiments are presented.

Tilt-critical algebras of tame type

Let A be a finite dimensional k-algebra over an algebraically closed field. Assume A=kQ/I where Q is a quiver without oriented cycles. We say that A is tilt-critical if it is not tilted but every proper convex subcategory of A is tilted. We describe the tilt-critical algebras which are strongly simply connected and tame.

On the Multiplicity of Orthogonal Geodesics in Riemannian Manifold With Concave Boundary. Applications to Brake Orbits and Homoclinics

Let (M, g) be a complete Riemannian Manifold, Omega subset of M an open subset whose closure is diffeomorphic to an annulus. If partial derivative Omega is smooth and it satisfies a strong concavity assumption, then it is possible to prove that there are at least two geometrically distinct geodesics in (Omega) over bar = Omega boolean OR partial derivative Omega starting orthogonally to one connected component of partial derivative Omega and arriving orthogonally onto the other one. The results given in [6] allow to obtain a proof of the existence of two distinct homoclinic orbits for an autonomous Lagrangian system emanating from a nondegenerate maximum point of the potential energy, and a proof of the existence of two distinct brake orbits for a. class of Hamiltonian systems. Under a further symmetry assumption, it is possible to show the existence of at least dim(M) pairs of geometrically distinct geodesics as above, brake orbits and homoclinics.

On Approximate KKT Condition and its Extension to Continuous Variational Inequalities

In this work, we introduce a necessary sequential Approximate-Karush-Kuhn-Tucker (AKKT) condition for a point to be a solution of a continuous variational inequality, and we prove its relation with the Approximate Gradient Projection condition (AGP) of Garciga-Otero and Svaiter. We also prove that a slight variation of the AKKT condition is sufficient for a convex problem, either for variational inequalities or optimization. Sequential necessary conditions are more suitable to iterative methods than usual punctual conditions relying on constraint qualifications. The AKKT property holds at a solution independently of the fulfillment of a constraint qualification, but when a weak one holds, we can guarantee the validity of the KKT conditions.