We consider online optimization problems with time-varying linear equality constraints. In this framework, an agent makes sequential decisions using only prior information. At every round, the suffers environment-determined loss and must satisfy Both functions constraints can be chosen adversarially. propose Online Projected Equality-constrained Newton Method (OPEN-M) to tackle family of proble...

We present quantitative models for the selection pressure of cellular evolutionary algorithms structured in two dimensional regular lattices. We derive models based on probabilistic difference equations for synchronous and several asynchronous cell update policies. Theoretical results are in agreement with experimental values and show that the selection intensity can be controlled by using diff...

We present quantitative models for the selection pressure on cellular evolutionary algorithms structured as a ring of cells. We obtain results for synchronous and asynchronous cell update policies. Theoretical results are in agreement with experimental values and show that the selection intensity can be controlled by using different update methods.

We show that Hessian manifolds of dimensions 4 and above must have vanishing Pontryagin forms. This gives a topological obstruction to the existence of Hessian metrics. We find an additional explicit curvature identity for Hessian 4-manifolds. By contrast, we show that all analytic Riemannian 2-manifolds are Hessian.

This paper considers the connection between the intrinsic Riemannian Newton method and other more classically inspired optimization algorithms for equality-constrained optimization problems. We consider the feasibly-projected sequential quadratic programming (FP-SQP) method and show that it yields the same update step as the Riemannian Newton, subject to a minor assumption on the choice of mult...

Abstract. We extend a structured selected inversion method to the extraction of any arbitrary entry of the inverse of a large sparse matrix A. For various discretized PDEs such as Helmholtz equations, a structured factorization yields a sequence of data-sparse factors of about O(n) nonzero entries, where n is the matrix size. We are then able to extract any arbitrary entry of A 1 in about O(log...

Differentiation is one of the fundamental problems in numerical mathematics. The solution of many optimization problems and other applications require knowledge of the gradient, the Jacobian matrix, or the Hessian matrix of a given function. Automatic differentiation (AD) is an upcoming powerful technology for computing the derivatives accurately and fast. ADMAT (Automatic Differentiation for M...

Structured-light illumination is a process of three-dimensional imaging where a series of time-multiplexed, striped patterns are projected onto a target scene with the corresponding captured images used to determine surface shape according to the warping of the projected patterns around the target. In a real-time system, a high-speed projector/camera pair is used such that any surface motion is...

A novel algorithm is proposed for extracting sharp features automatically and at optimal scale from point clouds. First, the vector between a given point and the centroid of its neighborhood at a given scale is projected on the normal at this point. This projection is called the ’projected distance’ at this point. The projected distance and surface normal vector are recalculated at several scal...

In this paper, we have developed an approach to specify when updating materialized webviews. A webview is a web page that is automatically constructed from a structured database. We have introduced a new update policy called “early ondemand” update which is based on the user preferences. Then we have combines this policy with the on-demand one to update the materialized webviews. Our experiment...