Related papers: Optimal combinations of imperfect objects

We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of $N$ such devices, which can be considered as the quantum analogue of classical anomaly detection. In the case where the devices…

The need for fast and robust optimization algorithms are of critical importance in all areas of machine learning. This paper treats the task of designing optimization algorithms as an optimal control problem. Using regret as a metric for an…

In this paper we propose a general algorithmic framework for first-order methods in optimization in a broad sense, including minimization problems, saddle-point problems and variational inequalities. This framework allows to obtain many…

In general, standard necessary optimality conditions cannot be formulated in a straightforward manner for semi-smooth shape optimization problems. In this paper, we consider shape optimization problems constrained by variational…

This chapter does not deal with specific tools and techniques for managing complex systems, but proposes some basic concepts that help us to think and speak about complexity. We review classical thinking and its intrinsic drawbacks when…

In this note we aim at putting more emphasis on the fact that trying to solve non-convex optimization problems with coordinate-descent iterative linear matrix inequality algorithms leads to suboptimal solutions, and put forward other…

We introduce a detailed analysis of the convergence of first-order methods with composite noise (sum of relative and absolute) in gradient for convex and smooth function minimization. This paper illustrates instances of practical problems…

Designing component-based constraint solvers is a complex problem. Some components are required, some are optional and there are interdependencies between the components. Because of this, previous approaches to solver design and…

This paper considers pairs of optimization problems that are defined from a single input and for which it is desired to find a good approximation to either one of the problems. In many instances, it is possible to efficiently find an…

The purpose of this work is to examine the structure of optimal dual fusion frames and get more exibility in the use of dual fusion frames for erasures of subspaces. We deal with optimal dual fusion frames with respect to different…

To arrive at some viable product design, product development processes frequently use numerical simulations and mathematical programming techniques. Topology optimization, in particular, is one of the most promising techniques for…

In this paper, gradient-based optimization methods are combined with finite-element modeling for improving electric devices. Geometric design parameters are considered by affine decomposition of the geometry or by the design element…

This article develops variational integrators for a class of underactuated mechanical systems using the theory of discrete mechanics. Further, a discrete optimal control problem is formulated for the considered class of systems and…

An invisibility device should guide light around an object as if nothing were there, regardless where the light comes from. Ideal invisibility devices are impossible due to the wave nature of light. This paper develops a general recipe for…

We consider fits to two or more datasets for which results from the sa me experiment share a common systematic uncertainty in addition to their individ ual statistical errors. This is important in extracting the maximum information from a…

Demixing is the problem of identifying multiple structured signals from a superimposed observation. This work analyzes a general framework, based on convex optimization, for solving demixing problems. We present a new solution to determine…

We deal with the presence of topological defects in models for two real scalar fields. We comment on defects hosting topological defects, and we search for explicit defect solutions using the trial orbit method. As we know, under certain…

We explore the possibility of accelerating the formal verification of classical programs with a quantum computer. A common source of security flaws stems from the existence of common programming errors like use after free, null-pointer…

The self-assembly of complex structures from engineered subunits is a major goal of nanotechnology, but controlling their size becomes increasingly difficult in larger assemblies. Existing strategies present significant challenges, among…

In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…