Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Concave function

Related publications (17)

Quadratic serendipity element shape functions on general planar polygons

Xiaodong Wei

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...

ELSEVIER SCIENCE SA2022

Adaptive Gradient Descent without Descent

We present a strikingly simple proof that two rules are sufficient to automate gradient descent: 1) don’t increase the stepsize too fast and 2) don’t overstep the local curvature. No need for functional values, no line search, no information about the func ...

2020

Direct FEM-Domain Decomposition Using Convex-to-Concave Spherical Ports for Space Applications

Juan Ramon Mosig, Javier Rubio, Pedro Robustillo Bayon

This letter proposes the application of a hybrid numerical technique to two cases of interest in the space business: the reallocation of radiators and scatters on satellite platforms; and the analysis of antennas for mobile communications. It is based on t ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2020

The Almost-Sure Asymptotic Behavior Of The Solution To The Stochastic Heat Equation With Levy Noise

Carsten Hao Ye Chong

We examine the almost-sure asymptotics of the solution to the stochastic heat equation driven by a Levy space-time white noise. When a spatial point is fixed and time tends to infinity, we show that the solution develops unusually high peaks over short tim ...

INST MATHEMATICAL STATISTICS2020

Supply-Power-Constrained Cable Capacity Maximization Using Multi-Layer Neural Networks

Erixhen Sula

We experimentally solve the problem of maximizing capacity under a total supply power constraint in a massively parallel submarine cable context, i.e., for a spatially uncoupled system in which fiber Kerr nonlinearity is not a dominant limitation. By using ...

IEEE Institute of Electrical and Electronics Engineers2020

Convergence of the Exponentiated Gradient Method with Armijo Line Search

Volkan Cevher, Yen-Huan Li

Consider the problem of minimizing a convex differentiable function on the probability simplex, spectrahedron, or set of quantum density matrices. We prove that the expo-nentiated gradient method with Armijo line search always converges to the optimum, if ...

2019

Constrained optimization applied to multiscale integrative modeling

Giorgio Elikem Tamo

Multiscale integrative modeling stands at the intersection between experimental and computational techniques to predict the atomistic structures of important macromolecules. In the integrative modeling process, the experimental information is often integra ...

EPFL2018

A feasible-side globally convergent modifier-adaptation scheme

Dominique Bonvin, Timm Faulwasser, Alejandro Gabriel Marchetti

In the context of static real-time optimization (RTO) of uncertain plants, the standard modifier-adaptation scheme consists in adding first-order correction terms to the cost and constraint functions of a model based optimization problem. If the algorithm ...

Elsevier Sci Ltd2017

Bidder optimal assignments for general utilities

Monika Henzinger

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u(i,j)(p(j)) expressing his utility of being matched to item j at price p(j). For this setting we prove that a bidder optimal outcome al ...

Elsevier Science Bv2013

Derivatives with respect to metrics and applications: subgradient marching algorithm

This paper introduces a subgradient descent algorithm to compute a Riemannian metric that minimizes an energy involving geodesic distances. The heart of the method is the Subgradient Marching Algorithm to compute the derivative of the geodesic distance wit ...

Springer2010

Continuity Properties of Law-Invariant (Quasi-)Convex Risk Functions on L∞

We study continuity properties of law-invariant (quasi-)convex functions f : L1(Ω,F, P) to ( ∞,∞] over a non-atomic probability space (Ω,F, P) .This is a supplementary note to [12] ...

Springer Verlag2010

Decomposition of Geometric Set Systems and Graphs

Doemoetoer Palvoelgyi

We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold coveri ...

EPFL2010

Processor Speed Control with Thermal Constraints

Giovanni De Micheli, David Atienza Alonso, Srinivasan Murali

We consider the problem of adjusting speeds of multiple computer processors, sharing the same thermal environment, such as a chip or multichip package. We assume that the speed of each processor (and associated variables such as power supply voltage) can b ...

2009

Configurational entropy of hard spheres

Giuseppe Foffi

We numerically calculate the configurational entropy Sconf of a binary mixture of hard spheres, by using a perturbed Hamiltonian method trapping the system inside a given state, which requires fewer assumptions than the previous methods (Speedy 1998 Mol.Ph ...

2007

Griffiths Kelly Sherman correlation inequalities: a useful tool in the theory of error correcting codes

Nicolas Macris

It is shown that a correlation inequality of statistical mechanics can be applied to linear low-density parity-check codes. Thanks to this tool we prove that, under a natural assumption, the exponential growth rate of regular low-density parity-check (LDPC ...

Institute of Electrical and Electronics Engineers2007

The Structure of Optimal Consumption Streams in General Incomplete Markets

Semyon Malamud

We prove that for any incomplete market and any concave utility function the marginal propensities to consume and to save are always positive. Furthermore, we intro- duce a class of incomplete markets that includes almost all well known examples of market ...

2007

A cross-layer design of wireless ad-hoc networks

We consider a cross-layer design of wireless ad-hoc networks. Traditional networking approaches optimize separately each of the three layers: physical layer, medium access and routing. This may lead to largely suboptimal network designs. In this work, we p ...

EPFL2005

Related publications (17)