Interior-point methods based on kernel functions for symmetric optimization
From MaRDI portal
Recommendations
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone
- A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- An interior-point method for symmetric optimization based on a new wide neighborhood
Cites work
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- A Jordan-algebraic approach to potential-reduction algorithms
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- Algebraic methods for diagonalization of a quaternion matrix in quaternionic quantum theory
- Conic convex programming and self-dual embedding
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Extension of primal-dual interior point algorithms to symmetric cones
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 951459 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- Inequalities: theory of majorization and its applications
- Monotone functions on formally real Jordan algebras
- Self-regular functions and new search directions for linear and semidefinite optimization
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- The exceptional Jordan eigenvalue problem
Cited in
(16)- Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions
- A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming
- Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods
- Derivatives of eigenvalues and Jordan frames
- A Lipschitzian error bound for monotone symmetric cone linear complementarity problem
- A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming
- New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems
- Fully Symmetric Kernel Quadrature
- New interior-point algorithm for symmetric optimization based on a positive-asymptotic barrier function
- A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones
- Extension of primal-dual interior point methods to diff-convex problems on symmetric cones
- A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions
- A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones
This page was built for publication: Interior-point methods based on kernel functions for symmetric optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2885493)
