Quasinormality in nonlinear second-order cone programming

We introduce quasinormality and pseudonormality for nonlinear second-order cone programming by exploiting the spectral geometry of the Lorentz cone. The proposed quasinormality distinguishes interior and boundary multipliers and, in the latter case, relates constraint violation to the corresponding spectral direction. It recovers classical quasinormality when all cone blocks are one-dimensional and is strictly weaker than … Read more

A hybrid branch-and-bound and interior-point algorithm for stochastic mixed-integer nonlinear second-order cone programming

One of the chief attractions of stochastic mixed-integer second-order cone programming is its diverse applications, especially in engineering (Alzalg and Alioui, {\em IEEE Access}, 10:3522-3547, 2022). The linear and nonlinear versions of this class of optimization problems are still unsolved yet. In this paper, we develop a hybrid optimization algorithm coupling branch-and-bound and primal-dual interior-point … Read more

The use of squared slack variables in nonlinear second-order cone programming

In traditional nonlinear programming, the technique of converting a problem with inequality constraints into a problem containing only equality constraints, by the addition of squared slack variables, is well-known. Unfortunately, it is considered to be an avoided technique in the optimization community, since the advantages usually do not compensate for the disadvantages, like the increase … Read more