Related papers: Linear complementarity problems on extended second…
The numerical performance of algorithms can be studied using test sets or procedures that generate such problems. This paper proposes various methods for generating linear, semidefinite, and second-order cone optimization problems.…
This article deals with the second order linear differential equations with entire coefficients. We prove some results involving conditions on coefficients so that the order of growth of every non-trivial solution is infinite.
We first highlight the main differences between second order and higher order linear parabolic equations. Then we survey existing results for the latter, in particular by analyzing the behavior of the convolution kernels. We illustrate the…
A new error bound for the linear complementarity problem is given when the involved matrix is a B-matrix. It is shown that this bound is sharper than some previous bounds [C.Q. Li, Y.T. Li. Note on error bounds for linear complementarity…
This paper is concerned with second-order optimality conditions for the mathematical program with semidefinite cone complementarity constraints (SDCMPCC).To achieve this goal, we first provide an exact characterization on the second-order…
In this paper, we have considered second order non-homogeneous linear differential equations having entire coefficients. We have established conditions ensuring non-existence of finite order solution of such type of differential equations.
The second-order tangent set is an important concept in describing the curvature of the set involved. Due to the existence of the complementarity condition, the second-order cone (SOC) complementarity set is a nonconvex set. Moreover,…
We derive a closed-form expression for the projection onto a capped rotated second-order cone -- a convex set that arises in perspective relaxations of nonlinear programs with binary indicator variables. The closed-form solution involves…
A new, second-order solution in curvilinear coordinates is introduced for the relative motion of two spacecraft on eccentric orbits. The second-order equations for unperturbed orbits are derived in spherical coordinates with true anomaly as…
We deal with the construction of linear connections associated with second order ordinary differential equations with and without first order constraints. We use a novel method allowing glueing of submodule covariant derivatives to produce…
Lie's linearizability criteria for scalar second-order ordinary differential equations had been extended to systems of second-order ordinary differential equations by using geometric methods. These methods not only yield the linearizing…
Many systems of interest to control engineering can be modeled by linear complementarity problems. We introduce a new notion of equivalence between linear complementarity problems that sets the basis to translate the powerful tools of…
In this work we extend the range of applicability of a method recently introduced where coupled first-order nonlinear equations can be put into a linear form, and consequently be solved completely. Some general consequences of the present…
In this paper we study second-order optimality conditions for non-convex set-constrained optimization problems. For a convex set-constrained optimization problem, it is well-known that second-order optimality conditions involve the support…
The congruence orbit of a matrix has a natural connection with the linear complementarity problem on simplicial cones formulated for the matrix. In terms of the two approaches -- the congruence orbit and the family of all simplicial cones…
Linear sets on the projective line have attracted a lot of attention because of their link with blocking sets, KM-arcs and rank-metric codes. In this paper, we study linear sets having two points of complementary weight, that is with two…
Recently, Chubanov proposed an interesting new polynomial-time algorithm for linear program. In this paper, we extend his algorithm to second-order cone programming.
In the last two decades, the sequential optimality conditions, which do not require constraint qualifications and allow improvement on the convergence assumptions of algorithms, had been considered in the literature. It includes the work by…
The basic tool for solving problems in metric geometry and isotonic regression is the metric projection onto closed convex cones. Isotonicity of these projections with respect to a given order relation can facilitate finding the solutions…
In the monotone integer dualization problem, we are given two sets of vectors in an integer box such that no vector in the first set is dominated by a vector in the second. The question is to check if the two sets of vectors cover the…