Pages that link to "Item:Q5945646"
From MaRDI portal
The following pages link to Generalization of primal-dual interior-point methods to convex optimization problems in conic form (Q5945646):
Displaying 14 items.
- On verified numerical computations in convex programming (Q849186) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- ``Cone-free'' primal-dual path-following and potential-reduction polynomial time interior-point methods (Q1771312) (← links)
- Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming (Q1779251) (← links)
- An interior method for nonconvex semidefinite programs (Q1863841) (← links)
- Newton polytopes and relative entropy optimization (Q2067684) (← links)
- On self-concordant barriers for generalized power cones (Q2115322) (← links)
- A primal-dual interior-point algorithm for nonsymmetric exponential-cone optimization (Q2149553) (← links)
- Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
- A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions (Q2316302) (← links)
- An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
- Primal-Dual Interior-Point Methods for Domain-Driven Formulations (Q5119848) (← links)
- Linear optimization over homogeneous matrix cones (Q6047504) (← links)
- (Q6149328) (← links)
