# Computer Engineering Commons™

University of Texas at El Paso

Constraints

Publication Year

Articles 1 - 6 of 6

## Full-Text Articles in Computer Engineering

Efficient Geophysical Technique Of Vertical Line Elements As A Natural Consequence Of General Constraints Techniques, Rolando Cardenas, Martine Ceberio Aug 2011

Adding Constraints -- A (Seemingly Counterintuitive But) Useful Heuristic In Solving Difficult Problems, Olga Kosheleva, Martine Ceberio, Vladik Kreinovich Dec 2010

#### Adding Constraints -- A (Seemingly Counterintuitive But) Useful Heuristic In Solving Difficult Problems, Olga Kosheleva, Martine Ceberio, Vladik Kreinovich

##### Departmental Technical Reports (CS)

Intuitively, the more constraints we impose on a problem, the more difficult it is to solve it. However, in practice, difficult-to-solve problems sometimes get solved when we impose additional constraints and thus, make the problems seemingly more complex. In this methodological paper, we explain this seemingly counter-intuitive phenomenon, and we show that, dues to this explanation, additional constraints can serve as a useful heuristic in solving difficult problems.

Towards An Efficient Bisection Of Ellipsoids, Paden Portillo, Martine Ceberio, Vladik Kreinovich Aug 2010

#### Towards An Efficient Bisection Of Ellipsoids, Paden Portillo, Martine Ceberio, Vladik Kreinovich

##### Departmental Technical Reports (CS)

Constraints are often represented as ellipsoids. One of the main advantages of such constrains is that, in contrast to boxes, over which optimization of even quadratic functions is NP-hard, optimization of a quadratic function over an ellipsoid is feasible. Sometimes, the area described by constrains is too large, so it is reasonable to bisect this area (one or several times) and solve the optimization problem for all the sub-areas. Bisecting a box, we still get a box, but bisecting an ellipsoid, we do not get an ellipsoid. Usually, this problem is solved by enclosing the half-ellipsoid in a larger ellipsoid ...

Constraint-Related Reinterpretation Of Fundamental Physical Equations Can Serve As A Built-In Regularization, Vladik Kreinovich, Juan Ferret, Martine Ceberio Aug 2010

#### Constraint-Related Reinterpretation Of Fundamental Physical Equations Can Serve As A Built-In Regularization, Vladik Kreinovich, Juan Ferret, Martine Ceberio

##### Departmental Technical Reports (CS)

Many traditional physical problems are known to be ill-defined: a tiny change in the initial condition can lead to drastic changes in the resulting solutions. To solve this problem, practitioners regularize these problem, i.e., impose explicit constraints on possible solutions (e.g., constraints on the squares of gradients). Applying the Lagrange multiplier techniques to the corresponding constrained optimization problems is equivalent to adding terms proportional to squares of gradients to the corresponding optimized functionals. It turns out that many optimized functionals of fundamental physics already have such squares-of-gradients terms. We therefore propose to re-interpret these equations -- by claiming that ...

Why Ellipsoid Constraints, Ellipsoid Clusters, And Riemannian Space-Time: Dvoretzky's Theorem Revisited, Karen Villaverde, Olga Kosheleva, Martine Ceberio Aug 2010

#### Why Ellipsoid Constraints, Ellipsoid Clusters, And Riemannian Space-Time: Dvoretzky's Theorem Revisited, Karen Villaverde, Olga Kosheleva, Martine Ceberio

##### Departmental Technical Reports (CS)

In many practical applications, we encounter ellipsoid constraints, ellipsoid-shaped clusters, etc. A usual justification for this ellipsoid shape comes from the fact that many real-life quantities are normally distributed, and for a multi-variate normal distribution, a natural confidence set (containing the vast majority of the objects) is an ellipsoid. However, ellipsoid appear more frequently than normal distributions (which occur in about half of the cases). In this paper, we provide a new justification for ellipsoids based on a known mathematical result -- Dvoretzky's Theorem.

How To Take Into Account Dependence Between The Inputs: From Interval Computations To Constraint-Related Set Computations, With Potential Applications To Nuclear Safety, Bio- And Geosciences, Martine Ceberio, Scott Ferson, Vladik Kreinovich, Sanjeev Chopra, Gang Xiang, Adrian Murguia, Jorge Santillan Nov 2006

#### How To Take Into Account Dependence Between The Inputs: From Interval Computations To Constraint-Related Set Computations, With Potential Applications To Nuclear Safety, Bio- And Geosciences, Martine Ceberio, Scott Ferson, Vladik Kreinovich, Sanjeev Chopra, Gang Xiang, Adrian Murguia, Jorge Santillan

##### Departmental Technical Reports (CS)

In many real-life situations, in addition to knowing the intervals Xi of possible values of each variable xi, we also know additional restrictions on the possible combinations of xi; in this case, the set X of possible values of x=(x1,..,xn) is a proper subset of the original box X1 x ... x Xn. In this paper, we show how to take into account this dependence between the inputs when computing the range of a function f(x1,...,xn).