Pages that link to "Item:Q1926650"
From MaRDI portal
The following pages link to A primal barrier function phase I algorithm for nonsymmetric conic optimization problems (Q1926650):
Displayed 13 items.
- A robust Lagrangian-DNN method for a class of quadratic optimization problems (Q523570) (← links)
- Smaller SDP for SOS decomposition (Q746820) (← links)
- A polynomial-time interior-point method for circular cone programming based on kernel functions (Q747043) (← links)
- Differential properties of Euclidean projection onto power cone (Q907372) (← links)
- On merit functions for \(p\)-order cone complementarity problem (Q2012235) (← links)
- Doubly nonnegative relaxations for quadratic and polynomial optimization problems with binary and box constraints (Q2144550) (← links)
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization (Q2353476) (← links)
- A nonmonotone smoothing Newton method for circular cone programming (Q2836100) (← links)
- A note on strict complementarity for the doubly non-negative cone (Q4634159) (← links)
- Variational analysis of circular cone programs (Q4981849) (← links)
- A self-concordant exponential kernel function for primal–dual interior-point algorithm (Q5169467) (← links)
- Constructions of complementarity functions and merit functions for circular cone complementarity problem (Q5963681) (← links)
- (Q6149328) (← links)