Pages that link to "Item:Q1599289"
From MaRDI portal
The following pages link to On a commutative class of search directions for linear programming over symmetric cones (Q1599289):
Displayed 22 items.
- Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
- Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
- An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← links)
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
- An efficient support vector machine learning method with second-order cone programming for large-scale problems (Q2576752) (← links)
- Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
- A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
- Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
- Several Jordan-algebraic aspects of optimization† (Q3507703) (← links)
- Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood (Q3514846) (← links)
- Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications (Q4807684) (← links)
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones (Q4916325) (← links)
- Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i><sub>*</sub>(κ)-SCLCP (Q5299915) (← links)
- A pivoting procedure for a class of second-order cone programming (Q5478872) (← links)
- Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem (Q5478873) (← links)