The following pages link to Second-order cone programming (Q1411628):
Displaying 50 items.
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- A primal-dual symmetric relaxation for homogeneous conic systems (Q883335) (← links)
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems (Q885308) (← links)
- Computing exact \(D\)-optimal designs by mixed integer second-order cone programming (Q888509) (← links)
- A perspective-based convex relaxation for switched-affine optimal control (Q893481) (← links)
- The \(H\)-differentiability and calmness of circular cone functions (Q897057) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- A generalization of the Craig-Sakamoto theorem to Euclidean Jordan algebras (Q905710) (← links)
- Differential properties of Euclidean projection onto power cone (Q907372) (← links)
- The solution set structure of monotone linear complementarity problems over second-order cone (Q924890) (← links)
- Complete characterizations of stable Farkas' lemma and cone-convex programming duality (Q927159) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming (Q949278) (← links)
- Analysis of a non-interior continuation method for second-order cone programming (Q949295) (← links)
- A one-step smoothing Newton method for second-order cone programming (Q953375) (← links)
- Risk management in uncapacitated facility location models with random demands (Q958433) (← links)
- Largest dual ellipsoids inscribed in dual cones (Q959981) (← links)
- Variable preference modeling with ideal-symmetric convex cones (Q960117) (← links)
- Strict semimonotonicity property of linear transformations on Euclidean Jordan algebras (Q965062) (← links)
- A one-parametric class of merit functions for the second-order cone complementarity problem (Q967218) (← links)
- Robust least squares solution of linear inequalities (Q968558) (← links)
- Parallel machine match-up scheduling with manufacturing cost considerations (Q969751) (← links)
- Nonsingularity in second-order cone programming via the smoothing metric projector (Q977261) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- Good hidden \(P\)-matrix sandwiches (Q996290) (← links)
- On the regularity of second order cone programs and an application to solving large scale problems (Q999131) (← links)
- A multisplitting method for symmetrical affine second-order cone complementarity problem (Q1005824) (← links)
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones (Q1014035) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- A one-parametric class of merit functions for the symmetric cone complementarity problem (Q1018348) (← links)
- A smoothing method for second order cone complementarity problem (Q1019772) (← links)
- Input selection and shrinkage in multiresponse linear regression (Q1020828) (← links)
- Positive principal minor property of linear transformations on Euclidean Jordan algebras (Q1024238) (← links)
- An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errors (Q1026115) (← links)
- Growth behavior of two classes of merit functions for symmetric cone complementarity problems (Q1029282) (← links)
- Analysis of a smoothing Newton method for second-order cone complementarity problem (Q1034984) (← links)
- Risk optimization with \(p\)-order conic constraints: a linear programming approach (Q1038319) (← links)
- Stochastic second-order cone programming in mobile ad hoc networks (Q1039371) (← links)
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems (Q1040684) (← links)
- Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions (Q1044081) (← links)
- Duality of nonconvex optimization with positively homogeneous functions (Q1616938) (← links)
- The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems (Q1625774) (← links)
- A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints (Q1634750) (← links)
- Primal Newton method for the linear cone programming problem (Q1644012) (← links)
- Time-dependent green Weber problem (Q1651568) (← links)
- Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP (Q1655386) (← links)
- Uncertainty-safe large scale support vector machines (Q1658451) (← links)
- A generalized smoothing Newton method for the symmetric cone complementarity problem (Q1659660) (← links)
