Interior-point methods based on kernel functions for symmetric optimization
From MaRDI portal
Publication:2885493
DOI10.1080/10556788.2010.544877zbMath1266.90144OpenAlexW2010982511MaRDI QIDQ2885493
Publication date: 23 May 2012
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2010.544877
Related Items (11)
A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A Lipschitzian error bound for monotone symmetric cone linear complementarity problem ⋮ Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions ⋮ Derivatives of eigenvalues and Jordan frames ⋮ 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 ⋮ Complexity of primal-dual interior-point algorithm for linear programming based on a new class of kernel functions ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over 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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Monotone functions on formally real Jordan algebras
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Extension of primal-dual interior point algorithms to symmetric cones
- A new class of polynomial primal-dual methods for linear and semidefinite optimization
- Self-regular functions and new search directions for linear and semidefinite optimization
- The exceptional Jordan eigenvalue problem
- Algebraic methods for diagonalization of a quaternion matrix in quaternionic quantum theory
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- A primal‐dual interior-point method for linear optimization based on a new proximity function
- Conic convex programming and self-dual embedding
- A polynomial-time algorithm for linear optimization based on a new simple kernel function
- A Comparative Study of Kernel Functions for Primal-Dual Interior-Point Algorithms in Linear Optimization
- Inequalities: theory of majorization and its applications
- A Jordan-algebraic approach to potential-reduction algorithms
This page was built for publication: Interior-point methods based on kernel functions for symmetric optimization
