3,461 research outputs found
Linear complementarity problems on extended second order cones
In this paper, we study the linear complementarity problems on extended
second order cones. We convert a linear complementarity problem on an extended
second order cone into a mixed complementarity problem on the non-negative
orthant. We state necessary and sufficient conditions for a point to be a
solution of the converted problem. We also present solution strategies for this
problem, such as the Newton method and Levenberg-Marquardt algorithm. Finally,
we present some numerical examples
On the cone eigenvalue complementarity problem for higher-order tensors
In this paper, we consider the tensor generalized eigenvalue complementarity
problem (TGEiCP), which is an interesting generalization of matrix eigenvalue
complementarity problem (EiCP). First, we given an affirmative result showing
that TGEiCP is solvable and has at least one solution under some reasonable
assumptions. Then, we introduce two optimization reformulations of TGEiCP,
thereby beneficially establishing an upper bound of cone eigenvalues of
tensors. Moreover, some new results concerning the bounds of number of
eigenvalues of TGEiCP further enrich the theory of TGEiCP. Last but not least,
an implementable projection algorithm for solving TGEiCP is also developed for
the problem under consideration. As an illustration of our theoretical results,
preliminary computational results are reported.Comment: 26 pages, 2 figures, 3 table
A sequential semidefinite programming method and an application in passive reduced-order modeling
We consider the solution of nonlinear programs with nonlinear
semidefiniteness constraints. The need for an efficient exploitation of the
cone of positive semidefinite matrices makes the solution of such nonlinear
semidefinite programs more complicated than the solution of standard nonlinear
programs. In particular, a suitable symmetrization procedure needs to be chosen
for the linearization of the complementarity condition. The choice of the
symmetrization procedure can be shifted in a very natural way to certain linear
semidefinite subproblems, and can thus be reduced to a well-studied problem.
The resulting sequential semidefinite programming (SSP) method is a
generalization of the well-known SQP method for standard nonlinear programs. We
present a sensitivity result for nonlinear semidefinite programs, and then
based on this result, we give a self-contained proof of local quadratic
convergence of the SSP method. We also describe a class of nonlinear
semidefinite programs that arise in passive reduced-order modeling, and we
report results of some numerical experiments with the SSP method applied to
problems in that class
A Semismooth Newton Method for Tensor Eigenvalue Complementarity Problem
In this paper, we consider the tensor eigenvalue complementarity problem
which is closely related to the optimality conditions for polynomial
optimization, as well as a class of differential inclusions with nonconvex
processes. By introducing an NCP-function, we reformulate the tensor eigenvalue
complementarity problem as a system of nonlinear equations. We show that this
function is strongly semismooth but not differentiable, in which case the
classical smoothing methods cannot apply. Furthermore, we propose a damped
semismooth Newton method for tensor eigenvalue complementarity problem. A new
procedure to evaluate an element of the generalized Jocobian is given, which
turns out to be an element of the B-subdifferential under mild assumptions. As
a result, the convergence of the damped semismooth Newton method is guaranteed
by existing results. The numerical experiments also show that our method is
efficient and promising
- …