CONVERGENCE OF A CLASS OF SEMI-IMPLICIT TIME-STEPPING SCHEMES FOR NONSMOOTH RIGID MULTIBODY DYNAMICS

In this work we present a framework for the convergence analysis in a measure differential inclusion sense of a class of time-stepping schemes for multibody dynamics with contacts, joints, and friction. This class of methods solves one linear complementarity problem per step and contains the semi-implicit Euler method, as well as trapezoidallike methods for which … Read more

A T-algebraic approach to primal-dual interior-point algorithms

Three primal-dual interior-point algorithms for homogeneous cone programming are presented. They are a short-step algorithm, a large-update algorithm, and a predictor-corrector algorithm. These algorithms are described and analyzed based on a characterization of homogeneous cone via T-algebra. The analysis show that the algorithms have polynomial iteration complexity. Citation Division of Mathematical Sciences, Nanyang Technological University, … Read more

SPECTRAL STOCHASTIC FINITE-ELEMENT METHODS FOR PARAMETRIC CONSTRAINED OPTIMIZATION PROBLEMS

We present a method to approximate the solution mapping of parametric constrained optimization problems. The approximation, which is of the spectral stochastic finite element type, is represented as a linear combination of orthogonal polynomials. Its coefficients are determined by solving an appropriate finite-dimensional constrained optimization problem. We show that, under certain conditions, the latter problem … Read more

Selective Gram-Schmidt orthonormalization for conic cutting surface algorithms

It is not straightforward to find a new feasible solution when several conic constraints are added to a conic optimization problem. Examples of conic constraints include semidefinite constraints and second order cone constraints. In this paper, a method to slightly modify the constraints is proposed. Because of this modification, a simple procedure to generate strictly … Read more

A new adaptive algorithm for linear multiobjective programming problems

In this paper, we present a new adaptive algorithm for defining the solution set of a multiobjective linear programming problem, where the decision variables are upper and lower bounded, using the direct support method. The principle particularitie of this method is the fact that it handles the bounds of variables such are they are initially … Read more

A Unified Theorem on SDP Rank Reduction

We consider the problem of finding a low-rank approximate solution to a system of linear equations in symmetric, positive semidefinite matrices. Specifically, let $A_1,\ldots,A_m \in \R^{n\times n}$ be symmetric, positive semidefinite matrices, and let $b_1,\ldots,b_m \ge 0$. We show that if there exists a symmetric, positive semidefinite matrix $X$ to the system $A_i \bullet X … Read more

Exact regularization of convex programs

The regularization of a convex program is exact if all solutions of the regularized problem are also solutions of the original problem for all values of the regularization parameter below some positive threshold. For a general convex program, we show that the regularization is exact if and only if a certain selection problem has a … Read more

A Proximal Point Algorithm with Bregman Distances for Quasiconvex Optimization over the Positive Orthant

We present an interior proximal point method with Bregman distance, whose Bregman function is separable and the zone is the interior of the positive orthant, for solving the quasiconvex optimization problem under nonnegative constraints. We establish the well-definedness of the sequence generated by our algorithm and we prove convergence to a solution point when the … Read more

Orbitopal Fixing

The topic of this paper are integer programming models in which a subset of 0/1-variables encode a partitioning of a set of objects into disjoint subsets. Such models can be surprisingly hard to solve by branch-and-cut algorithms if the permutation of the subsets of the partition is irrelevant. This kind of symmetry unnecessarily blows up … Read more

A Routing and Network Dimensioning Strategy to reduce Wavelength Continuity Conflicts in All-Optical Networks

Due to the high computational complexity of exact methods (e.g., integer programming) for routing and wavelength assigment in optical networks, it is beneficial to decompose the problem into a routing task and a wavelength allocation task. However, by this decomposition it is not necessarily possible to obtain a valid wavelength assignment for a given routing … Read more