Pages that link to "Item:Q1383772"
From MaRDI portal
The following pages link to Euclidean Jordan algebras and interior-point algorithms (Q1383772):
Displaying 50 items.
- A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP (Q279828) (← links)
- Derivatives of eigenvalues and Jordan frames (Q317127) (← 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)
- Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems (Q431004) (← links)
- A weighted-path-following method for symmetric cone linear complementarity problems (Q478931) (← links)
- A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function (Q483254) (← links)
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
- A polynomial primal-dual affine scaling algorithm for symmetric conic optimization (Q523579) (← links)
- A new class of complementarity functions for symmetric cone complementarity problems (Q537637) (← links)
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
- Convergence of a non-interior continuation algorithm for the monotone SCCP (Q601939) (← links)
- Polynomial time solvability of non-symmetric semidefinite programming (Q613324) (← links)
- An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming (Q616787) (← links)
- Full Nesterov-Todd step infeasible interior-point method for symmetric optimization (Q635148) (← links)
- The \(Q\) method for symmetric cone programming (Q639204) (← links)
- A smoothing Newton method for second-order cone optimization based on a new smoothing function (Q648325) (← links)
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
- Improved smoothing Newton methods for symmetric cone complementarity problems (Q691381) (← links)
- The same growth of FB and NR symmetric cone complementarity functions (Q691418) (← links)
- Some P-properties for linear transformations on Euclidean Jordan algebras (Q703633) (← links)
- Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function (Q711514) (← links)
- A new one-step smoothing Newton method for second-order cone programming. (Q713481) (← links)
- Bilinear optimality constraints for the cone of positive polynomials (Q717131) (← links)
- A new class of smoothing complementarity functions over symmetric cones (Q720236) (← links)
- A new smoothing Newton-type method for second-order cone programming problems (Q734859) (← links)
- A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization (Q743780) (← links)
- Analysis of a smoothing method for symmetric conic linear programming (Q854421) (← links)
- Estimation of normal covariance matrices parametrized by irreducible symmetric cones under Stein's loss (Q864270) (← links)
- An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
- A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
- A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- A globally convergent non-interior point algorithm with full Newton step for second-order cone programming (Q993313) (← links)
- A one-parametric class of merit functions for the symmetric cone complementarity problem (Q1018348) (← links)
- Numerical experiments with universal barrier functions for cones of Chebyshev systems (Q1029624) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search (Q1041534) (← 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)
- Similarity and other spectral relations for symmetric cones (Q1573667) (← links)
- A path following interior-point method for linear complementarity problems over circular cones (Q1630229) (← links)
- Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions (Q1644105) (← links)
- Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems (Q1686542) (← links)
- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions (Q1697897) (← links)
- An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
- Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones (Q1730771) (← links)
- An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood (Q1731107) (← links)
