Second Order Cone problems (SOCPs)
Second order cone problems (SOCP) are a special class of quadratically constrained problems, where the quadratic matrix Q is not required to be semi–definite.
The FICO Xpress Optimizer supports (mixed integer) second order cone problems that satisfy the following requirements.
Each quadratic constraint satisfies one of the following two forms:
- Second order (or Lorentz) cone: x12+x12+...+xk2-t2≤0 where t≥0
- Rotated second order (or Lorentz) cone: x12+x12+...+xk2-2t1t2≤0 where t1,t2≥0
All of the cone coefficients must be exactly one, except for the coefficient of 2 for the t1t2 product. Constants or linear terms are not allowed.
Cones cannot be overlapping. That is, a variable x can appear in at most one second–order cone constraint.
Second order cone problems are loaded using the same API functions as for quadratic constraints, and the conic constraints are auto-detected by the optimizer at run time.
© 2001-2019 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.