Pages that link to "Item:Q3629526"
From MaRDI portal
The following pages link to A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming (Q3629526):
Displaying 10 items.
- A proximal point algorithm for the monotone second-order cone complementarity problem (Q429513) (← links)
- SOC-monotone and SOC-convex functions vs. matrix-monotone and matrix-convex functions (Q442689) (← links)
- Constraint consensus methods for finding interior feasible points in second-order cones (Q624763) (← links)
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming (Q937140) (← links)
- Interior proximal methods and central paths for convex second-order cone programming (Q992842) (← links)
- Some characterizations for SOC-monotone and SOC-convex functions (Q1037358) (← links)
- Interior point methods for second-order cone programming and OR applications (Q1888149) (← links)
- Monotonicity and circular cone monotonicity associated with circular cones (Q2359137) (← links)
- A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function (Q2817226) (← links)
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines (Q3161147) (← links)
