Lagrange-type duality in DC programming

We show a Lagrange-type duality theorem for a DC programming problem, which is a generalization of previous results by J.-E. Martínez-Legaz, M. Volle [5] and Y. Fujiwara, D. Kuroiwa [1] when all constraint functions are real-valued. To the purpose, we decompose the DC programming problem into certain infinite convex programming problems.     

Riemann boundary value problem for harmonic functions in Clifford analysis

In this article, we mainly deal with the boundary value problem for harmonic function with values in Clifford algebra: where is a Liapunov surface in , the Dirac operator , are unknown functions with values in a universal Clifford algebra Under some assumptions, we show that the boundary value problem is solvable.     

The Dirichlet problem for non‐divergence parabolic equations with discontinuous in time coefficients in a wedge

We consider the Dirichlet problem in a wedge for parabolic equation whose coefficients are measurable function of t. We obtain coercive estimates in weighted ‐spaces. The concept of “critical exponent” introduced in the paper plays here the crucial role. Various important properties of the critical exponent are proved. We give applications to the Dirichlet problem for linear and quasi‐linear non‐divergence parabolic equations with discontinuous in time coefficients in cylinders , where Ω is a bounded domain with an edge or with a conical point.     

Comparison theorems for self‐adjoint linear Hamiltonian eigenvalue problems

In this work we derive new comparison results for (finite) eigenvalues of two self‐adjoint linear Hamiltonian eigenvalue problems. The coefficient matrices depend on the spectral parameter nonlinearly and the spectral parameter is present also in the boundary conditions. We do not impose any controllability or strict normality assumptions. Our method is based on a generalization of the Sturmian comparison theorem for such systems. The results are new even for the Dirichlet boundary conditions, for linear Hamiltonian systems depending linearly on the spectral parameter, and for Sturm–Liouville eigenvalue problems with nonlinear dependence on the spectral parameter.     

Re-formulation of inverse Gaussian,reciprocal inverse Gaussian,and Birnbaum–Saunders kernel estimators

We reveal the boundary bias problem of Birnbaum–Saunders, inverse Gaussian, and reciprocal inverse Gaussian kernel estimators (Jin and Kawczak, 2003, Scaillet, 2004) and re-formulate these estimators to solve the problem. We investigate asymptotic properties of a new class of asymmetric kernel estimators.     

Approximating Pareto curves using semidefinite relaxations

We approximate as closely as desired the Pareto curve associated with bicriteria polynomial optimization problems. We use three formulations (including the weighted sum approach and the Chebyshev approximation) and each of them is viewed as a parametric polynomial optimization problem. For each case is associated a hierarchy of semidefinite relaxations and from an optimal solution of each relaxation one approximates the Pareto curve by solving an inverse problem (first two cases) or by building a polynomial underestimator (third case).     

Constant-factor approximations for Capacitated Arc Routing without triangle inequality

Given an undirected graph with edge costs and edge demands, the Capacitated Arc Routing problem (CARP) asks for minimum-cost routes for equal-capacity vehicles so as to satisfy all demands. Constant-factor polynomial-time approximation algorithms were proposed for CARP with triangle inequality, while CARP was claimed to be NP-hard to approximate within any constant factor in general. Correcting this claim, we show that any factor  α$\alpha$ approximation for CARP with triangle inequality yields a factor  α$\alpha$ approximation for the general CARP.