We explore modifications of the standard cutting-plane approach for minimizing a convex nondifferentiable function, given by an oracle, over a combinatorial set, which is the basis of the celebrated (generalized) Benders’ decomposition approach. Specifically, we combine stabilization—in two ways: via a trust region in the L1 norm, or via a level constraint—and inexact function computation (solu...

We present a planarity constraint and a novel three-dimensional (3D) point reconstruction algorithm for a multiview laser range slit scanner. The constraint is based on the fact that all observed points on a projected laser line lie on the same plane of laser light in 3D. The parameters of the plane of laser light linearly parametrize a homography between a pair of images of the laser points. T...

We introduce the MULTI-INTER-DISTANCE constraint that ensures no more than m variables are assigned to values lying in a window of p consecutive values. This constraint is useful for modelling scheduling problems where tasks of processing time p compete for m identical resources. We present a propagator that achieves bounds consistency in cubic time. Experiments show that this new constraint of...

Ductile-brittle fracture transition was investigated using compact tension (CT) specimens from -70 o C to 40 o C for a carbon steel. Large deformation finite element analysis has been carried out to simulate the stable crack growth in the compact tension (CT, a/W=0.6), three point-point bend (SE(B), a/W=0.1) and centre-cracked tension (M(T), a/W=0.5) specimens. Experimental crack tip opening di...

An arbitrary subset (n − m) of the n closed loop eigenvalues of an n order continuous time single input linear time invariant (LTI) system is to be placed using full state feedback, at pre-specified locations in the complex plane. The remaining m closed loop eigenvalues can be placed anywhere inside a pre-defined region in the complex plane. This region constraint on the unspecified poles is tr...

In this paper, we propose a level set approach to decompose the image plane into segments with consistent apparent motion and recover parametric models that best describe such a motion. The number of motion planes and initial motion parameters are obtained by robust block-wise optical flow estimation, followed by non-parametric clustering in the motion parameter space. Implicit representations ...

Joint chance constrained problems give rise to many algorithmic challenges. Even in the convex case, i.e., when an appropriate transformation of the probabilistic constraint is a convex function, its cutting-plane linearization is just an approximation, produced by an oracle providing subgradient and function values that can only be evaluated inexactly. As a result, the cutting-plane model may ...

To reduce cutting time and costs, an optimization model of cutting parameter is proposed. Constraints like lathe and cutting tool are fully considered. The objective function is aiming at the target of profit margins. Some empirical indexes are used in the constraints and the objective function since the special properties of cutting process. The Fuzzy Comprehensive Evaluation Method is used to...

seismic retrofit of masonry slabs in existing steel or masonry buildings has found special significance in current codes as failure of unstable jack arch slabs has been reported as a major reason for collapsing structures in middle east deadly earthquakes. in this paper, three retrofit schemes are investigated and compared. the proposed rehabilitation techniques consist of a single x strapping,...

This paper addresses a number of issues concerning the integration of visual and physical constraints f o r the synthesis and execution of error-tolerant mot ion strategies. Object features and their projections onto the image plane of a supervisory camera are used t o define visual constraint surfaces. These visual constraint surfaces can be directly used t o enforce the following types of con...