And out of the confusion Where the river meets the sea Something new would arrive Something better would arrive... " Acknowledgements The doctoral thesis at hand is the result of my research during the time as a Ph.D. student at the Department of Mathematics at the University of Würzburg. In a long-term project like this one, there are, of course, several ups and downs, and hence one is lucky t...

Abstract In this paper, a class of directionally differentiable multiobjective programming problems with inequality, equality and vanishing constraints is considered. Under both the Abadie constraint qualification modified qualification, Karush–Kuhn–Tucker type necessary optimality conditions are established for such nondifferentiable vector optimization by using nonlinear version Gordan theore...

In this paper, a design method of two-dimensional (2-D) orthogonal symmetric wavelets is proposed by using a lattice structure for multi-dimensional (M-D) linear-phase paraunitary filter banks (LPPUFB), which the authors have proposed as a previous work and then modified by Lu Gan et al. The derivation process for the constraints on the second-order vanishing moments is shown and some design ex...

This paper studies the convex multiobjective optimization problem with vanishing constraints‎. ‎We introduce a new constraint qualification for these problems‎, ‎and then a necessary optimality condition for properly efficient solutions is presented‎. ‎Finally by imposing some assumptions‎, ‎we show that our necessary condition is also sufficient for proper efficiency‎. ‎Our results are formula...

In this paper, our goal is to reconstruct metric 3D models for large structures (or other 3D objects) from uncalibrated images. The internal camera parameters are estimated by using homographic constraints. More specifically, we propose to use straight lines and vanishing points to compute the infinite homography. However, because vanishing points are very sensitive to noise, we propose further...

We propose an SQP algorithm for mathematical programs with vanishing constraints which solves at each iteration a quadratic program with linear vanishing constraints. The algorithm is based on the newly developed concept of [Formula: see text]-stationarity (Benko and Gfrerer in Optimization 66(1):61-92, 2017). We demonstrate how [Formula: see text]-stationary solutions of the quadratic program ...

1. Abstract The talk deals with optimization problems with vanishing constraints, i.e., with constraints that must not be considered at certain points of the feasible domain. Such formulations are typical in Topology Optimization where ”mechanical response” of vanishing structural members gets lost during optimization, and thus certain function values become undefined. As an example, consider t...

In this paper we describe a flexible approach for determining the relative orientation of the camera with respect to the scene. The main premise of the approach is the fact that in man-made environments, the majority of lines is aligned with the principal orthogonal directions of the world coordinate frame. We exploit this observation towards efficient detection and estimation of vanishing poin...