Publications associées à Auxiliary normed space

Non-normal forms

In this thesis, we propose to formally derive amplitude equations governing the weakly nonlinear evolution of non-normal dynamical systems, when they respond to harmonic or stochastic forcing, or to an initial condition. This approach reconciles the non-mo ...

EPFL2024

Two mixed finite element formulations for the weak imposition of the Neumann boundary conditions for the Darcy flow

Erik Burman, Riccardo Puppi

We propose two different discrete formulations for the weak imposition of the Neumann boundary conditions of the Darcy flow. The Raviart-Thomas mixed finite element on both triangular and quadrilateral meshes is considered for both methods. One is a consis ...

Walter De Gruyter2021

Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b, x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m), and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2020

Sphere-of-Influence Graphs in Normed Spaces

János Pach, Márton Naszódi

We showthat any k-th closed sphere-of-influence graph in a d-dimensional normed space has a vertex of degree less than 5dk, thus obtaining a common generalization of results of Furedi and Loeb (Proc AmMath Soc 121(4): 1063-1073, 1994 [1]) and Guibas et al. ...

SPRINGER2018

Towards Norm Realization in Institutions Mediating Human-Robot Societies

Alcherio Martinoli, Stevan Tomic, Alicja Barbara Roelofsen

Social norms are the understandings that govern the behavior of members of a society. As such, they regulate communication, cooperation and other social interactions. Robots capable of reasoning about social norms are more likely to be recognized as an ext ...

2018

Proximity results and faster algorithms for Integer Programming using the Steinitz Lemma

Friedrich Eisenbrand

We consider integer programming problems in standard form max{c(T)x : Ax = b; x >= 0, x is an element of Z(n)} where A is an element of Z(mxn), b is an element of Z(m) and c is an element of Z(n). We show that such an integer program can be solved in time ...

ASSOC COMPUTING MACHINERY2018

epsilon-Coresets for Clustering (with Outliers) in Doubling Metrics

Lingxiao Huang, Jian Li

We study the problem of constructing epsilon-coresets for the (k, z)-clustering problem in a doubling metric M(X, d). An epsilon-coreset is a weighted subset S subset of X with weight function w : S -> R->= 0, such that for any k-subset C is an element of ...

IEEE COMPUTER SOC2018

Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization

Volkan Cevher, Jonathan Mark Scarlett, Ilija Bogunovic

In this paper, we consider the problem of sequentially optimizing a black-box function

f

based on noisy samples and bandit feedback. We assume that

f

is smooth in the sense of having a bounded norm in some reproducing kernel Hilbert space (RKHS), yield ...

2017

Hypomonotonicity of the Normal Cone and Proximal Smoothness

Grigory Ivanov

We study the properties of the normal cone to a proximally smooth set. We give a complete characterization of a proximally smooth set through the monotonicity properties of its normal cone in an arbitrary uniformly convex and uniformly smooth Banach space. ...

Heldermann Verlag2017

General Proximal Gradient Method: A Case for Non-Euclidean Norms

Volkan Cevher, Ya-Ping Hsieh, Marwa El Halabi, Cong Bang Vu, Van Quang Nguyen

In this paper, we consider composite convex minimization problems. We advocate the merit of considering Generalized Proximal gradient Methods (GPM) where the norm employed is not Euclidean. To that end, we show the tractability of the general proximity ope ...

2017

Sparse projections onto the simplex

Volkan Cevher, Christoph Koch, Anastasios Kyrillidis

Most learning methods with rank or sparsity constraints use convex relaxations, which lead to optimization with the nuclear norm or the`1-norm. However, several important learning applications cannot benet from this approach as they feature these convex no ...

JMLR W&CP2013

Time-Optimal Path Following for Robots With Convex-Concave Constraints Using Sequential Convex Programming

Quoc Tran Dinh

Time-optimal path following considers the problem of moving along a predetermined geometric path in minimum time. In the case of a robotic manipulator with simplified constraints, a convex reformulation of this optimal control problem has been derived prev ...

Institute of Electrical and Electronics Engineers2013

The corona theorem for the Drury–Arveson Hardy space and other holomorphic Besov–Sobolev spaces on the unit ball in C-n

We prove that the multiplier algebra of the Drury-Arveson Hardy space H-n(2) on the unit ball in C-n has no corona in its maximal ideal space, thus generalizing the corona theorem of L. Carleson to higher dimensions. This result is obtained as a corollary ...

2011

A note on topological amenability

Nicolas Monod

A simple characterisation of topological amenability in terms of bounded cohomology is proved, following Johnson's formulation of amenability. The connection to injective Banach modules is established. ...

Oxford University Press2010

Drift Correction in Multivariate Calibration Models Using On-line Reference Measurements

Dominique Bonvin, Michael Amrhein, Pamandeep Singh Gujral

On-line measurements from first-order instruments such as spectrometers may be compromised by instrumental, process and operational drifts that are not seen during off-line calibration. This can render the calibration model unsuitable for prediction of key ...

2009