Least-Squares Minimization Under Constraints

نویسندگان

  • P. Fua
  • A. Varol R. Urtasun
  • M. Salzmann
چکیده

These algorithms are, however, not designed to perform least-squares minimization under hard constraints. This short report outlines two very simple approaches to doing this to solve problems such as the one depicted by Fig. 1. The first relies on standard Lagrange multipliers [Boyd and Vandenberghe, 2004]. The second is inspired by inverse kinematics techniques [Baerlocher and Boulic, 2004] and has been demonstrated for the purpose of monocular 3D surface modeling in [Salzmann and Fua, 2010]. In both cases, we outline matlab implementations.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iterative Reweighted Algorithms for Matrix Rank Minimization Iterative Reweighted Algorithms for Matrix Rank Minimization

The problem of minimizing the rank of a matrix subject to affine constraints has many applications in machine learning, and is known to be NP-hard. One of the tractable relaxations proposed for this problem is nuclear norm (or trace norm) minimization of the matrix, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Re...

متن کامل

Iterative reweighted algorithms for matrix rank minimization

The problem of minimizing the rank of a matrix subject to affine constraints has applications in several areas including machine learning, and is known to be NP-hard. A tractable relaxation for this problem is nuclear norm (or trace norm) minimization, which is guaranteed to find the minimum rank matrix under suitable assumptions. In this paper, we propose a family of Iterative Reweighted Least...

متن کامل

Least squares and shrinkage estimation under bimonotonicity constraints

In this paper we describe active set type algorithms for minimization of a smooth function under general order constraints, an important case being functions on the set of bimonotone r × s matrices. These algorithms can be used, for instance, to estimate a bimonotone regression function via least squares or (a smooth approximation of) least absolute deviations. Another application is shrinkage ...

متن کامل

A Note on Alternative Matrix Entry Estimation Techniques

Estimation of trip tables and other matrices that are subject to constraints is a common practical problem. This note reviews four common estimation methods: (1) minimization of the sum of absolute deviations, (2) the biproportional technique, (3) information minimization and (4) constrained generalized least squares (CGLS) regression. A small example illustrates their application. Computationa...

متن کامل

Data Reconciliation under Fuzzy Constraints in Material Flow Analysis

Data reconciliation consists in modifying noisy or unreliable data in order to make them consistent with a mathematical model (herein a material flow network). The conventional approach relies on least squares minimization. Here we show that the setting of fuzzy sets provides a generalized approach that is more flexible and less dependent on oftentimes debatable probabilistic justifications. Mo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011