Primal Attainment in Convex Infinite Optimization Duality

This article provides results guarateeing that the optimal value of a given convex infinite optimization problem and its corresponding surrogate Lagrangian dual coincide and the primal optimal value is attainable. The conditions ensuring converse strong Lagrangian (in short, minsup) duality involve the weakly-inf-(locally) compactness of suitable functions and the linearity or relative closedness of some sets depending on the data. Applications are given to different areas of convex optimization, including an extension of the Clark-Duffin Theorem for ordinary convex programs.

Walking Through Cantor's Paradise and Escher's Garden: Epistemological Reflections on the Mathematical Infinite (II)

Infinity is not an easy concept. A number of difficulties that people cope with when dealing with problems related to infinity include its abstract nature, understanding infinity as an ongoing, never ending process, understanding infinity as a set of an infinite number of elements and appreciating well-known paradoxes. Infinity can be understood in several ways with often incompatible meanings, and can involve value judgments or assumptions that are neither explicit nor desired. To usher in its definition, we distinguish several aspects, teleological, artistic (Escher); some definitive, some potential, and others actual. This article also deals with some still unresolved aspects of the concept of infinity.

Comparative study of RPSALG algorithm for convex semi-infinite programming

The Remez penalty and smoothing algorithm (RPSALG) is a unified framework for penalty and smoothing methods for solving min-max convex semi-infinite programing problems, whose convergence was analyzed in a previous paper of three of the authors. In this paper we consider a partial implementation of RPSALG for solving ordinary convex semi-infinite programming problems. Each iteration of RPSALG involves two types of auxiliary optimization problems: the first one consists of obtaining an approximate solution of some discretized convex problem, while the second one requires to solve a non-convex optimization problem involving the parametric constraints as objective function with the parameter as variable. In this paper we tackle the latter problem with a variant of the cutting angle method called ECAM, a global optimization procedure for solving Lipschitz programming problems. We implement different variants of RPSALG which are compared with the unique publicly available SIP solver, NSIPS, on a battery of test problems.

New glimpses on convex infinite optimization duality

Given a convex optimization problem (P) in a locally convex topological vector space X with an arbitrary number of constraints, we consider three possible dual problems of (P), namely, the usual Lagrangian dual (D), the perturbational dual (Q), and the surrogate dual (Δ), the last one recently introduced in a previous paper of the authors (Goberna et al., J Convex Anal 21(4), 2014). As shown by simple examples, these dual problems may be all different. This paper provides conditions ensuring that inf(P)=max(D), inf(P)=max(Q), and inf(P)=max(Δ) (dual equality and existence of dual optimal solutions) in terms of the so-called closedness regarding to a set. Sufficient conditions guaranteeing min(P)=sup(Q) (dual equality and existence of primal optimal solutions) are also provided, for the nominal problems and also for their perturbational relatives. The particular cases of convex semi-infinite optimization problems (in which either the number of constraints or the dimension of X, but not both, is finite) and linear infinite optimization problems are analyzed. Finally, some applications to the feasibility of convex inequality systems are described.

Constraint qualifications in convex vector semi-infinite optimization

Convex vector (or multi-objective) semi-infinite optimization deals with the simultaneous minimization of finitely many convex scalar functions subject to infinitely many convex constraints. This paper provides characterizations of the weakly efficient, efficient and properly efficient points in terms of cones involving the data and Karush–Kuhn–Tucker conditions. The latter characterizations rely on different local and global constraint qualifications. The results in this paper generalize those obtained by the same authors on linear vector semi-infinite optimization problems.

The characteristic impedance of the fin antenna of infinite length /

"Contract No. AF33(616)-3220 Project No. 6(7-4600) Task 40572 Wright Air Development Center"

A study of the non-uniform convergence of the inverse of a doubly-infinite matrix associated with a boundary value problem in a waveguide /

"Contract AF33(616)-6079 Project No. 9-(13-6278), Task No. 40572. Sponsored by: Aeronautical Systems Division"

On the solution of a class of Wiener-Hopf integral equations in finite and infinite ranges /

"Sponsored by: Wright Air Development Center"

A blast-wave theory of crater formation in semi-infinite targets,

"Resaerch...sponsored by the National Aeronautics and Space Administration under Contract no. NAS 3-2121."

Acoustic radiation of a cylindrical bar and an infinite plate excited by the field of a ship propeller,

Photocopy.

Binns's justice : Digest of the laws and judicial decisions of Pennsylvania, touching the authority and duties of justices of the peace: including all the required forms of process, docket entries, and fee bills ... The whole law in relation to landlord and tenant; insolvent debtors; elections; and fees: the general enactments of the inspection laws; militia laws; and many other laws: with an infinite variety of law forms ... /

The Magistrate's vocabulary of law terms and law phrases: p. 41-61.

Back scattering of a plane electromagnetic wave from an infinite cylinder of plasma with small axial gradients and arbitrary radial gradients of electron density : normal incidence /

"Prepared under contract no. NOrd 18053."

Finite elastic analysis of an infinite plate with an elliptic hole.

1. Plane strain.

An introduction to the theory of infinite series,

Mode of access: Internet.

Lucio Fauno. Della antichita della citta di Roma, raccolte e scritte da m. Lucio Fauno con somma breuità, & ordine, con quanto gli Antichi o Moderni scritti ne hanno libri V. Reuisti hora, e corretti dal medesimo autore in molti luoghi, con aggiungerui per tutto infinite cose degne, e con un compendio di Roma Antica nel fine, doue con somma breuita si uede quanto in tutti questi libri si dice.

Mode of access: Internet.