Dini Derivative and a Characterization for Lipschitz and Convex Functions on Riemannian Manifolds

Dini derivative on Riemannian manifold setting is studied in this paper. In addition, a characterization for Lipschitz and convex functions defined on Riemannian manifolds and sufficient optimality conditions for constraint optimization problems in terms of the Dini derivative are given. ArticleDownload View PDF

Hybrid heuristics for the permutation flow shop problem

The Flow Shop Problem (FSP) is known to be NP-hard when more than three machines are considered. Thus, for non-trivial size problem instances, heuristics are needed to find good orderings. We consider the permutation case of this problem. For this case, denoted by F|prmu|Cmax, the sequence of jobs has to remain the same at each … Read more

The Mixing-MIR Set with Divisible Capacities

We study the set $S = \{(x, y) \in \Re_{+} \times Z^{n}: x + B_{j} y_{j} \geq b_{j}, j = 1, \ldots, n\}$, where $B_{j}, b_{j} \in \Re_{+} – \{0\}$, $j = 1, \ldots, n$, and $B_{1} | \cdots | B_{n}$. The set $S$ generalizes the mixed-integer rounding (MIR) set of Nemhauser and Wolsey and … Read more

A Filter Algorithm for Nonlinear Semidefinite Programming

This paper proposes a filter method for solving nonlinear semidefinite programming problems. Our method extends to this setting the filter SQP (sequential quadratic programming) algorithm, recently introduced for solving nonlinear programming problems, obtaining their respective global convergence results. CitationCMM-B-06/10 – 171 Centre for Mathematical Modelling, UMR 2071, Universidad de Chile-CNRS. Casilla 170-3 Santiago 3, Chile … Read more

Solving systems of nonlinear equations with continuous GRASP

A method for finding all roots of a system of nonlinear equations is described. Our method makes use of C-GRASP, a recently proposed continuous global optimization heuristic. Given a nonlinear system, we solve a corresponding adaptively modified global optimization problem multiple times, each time using C-GRASP, with areas of repulsion around roots that have already … Read more

The Hybrid Maximum Principle is a consequence of Pontryagin Maximum Principle

We give a simple proof of the Maximum Principle for smooth hybrid control systems by reducing the hybrid problem to an optimal control problem of Pontryagin type and then by using the classical Pontryagin Maximum Principle. CitationA.V. Dmitruk, A.M. Kaganovich. The Hybrid Maximum Principle is a consequence of Pontryagin Maximum Principle, Systems & Control Letters, … Read more

Portfolio Selection with Robust Estimation

Mean-variance portfolios constructed using the sample mean and covariance matrix of asset returns perform poorly out-of-sample due to estimation error. Moreover, it is commonly accepted that estimation error in the sample mean is much larger than in the sample covariance matrix. For this reason, practitioners and researchers have recently focused on the minimum-variance portfolio, which … Read more

What Multistage Stochastic Programming Can Do for Network Revenue Management

Airlines must dynamically choose how to allocate their flight capacity to incoming travel demand. Because some passengers take connecting flights, the decisions for all network flights must be made simultaneously. To simplify the decision making process, most practitioners assume demand is deterministic and equal to average demand. We propose a multistage stochastic programming approach that … Read more

GRASP with path-relinking for network migration scheduling

Network migration scheduling is the problem where inter-nodal traffic from an outdated telecommunications network is to be migrated to a new network. Nodes are migrated, one at each time period, from the old to the new network. All traffic originating or terminating at given node in the old network is moved to a specific node … Read more

Semidefinite programming, multivariate orthogonal polynomials, and codes in spherical caps

In this paper we apply the semidefinite programming approach developed by the authors to obtain new upper bounds for codes in spherical caps. We compute new upper bounds for the one-sided kissing number in several dimensions where we in particular get a new tight bound in dimension 8. Furthermore we show how to use the … Read more