On a commutative class of search directions for linear programming over symmetric cones
From MaRDI portal
Publication:1599289
DOI10.1023/A:1017920200889zbMath0994.90095MaRDI QIDQ1599289
Publication date: 9 June 2002
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1017920200889
Related Items
Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones, Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications, Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones, Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones, Unnamed Item, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A pivoting procedure for a class of second-order cone programming, Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Curvature integrals and iteration complexities in SDP and symmetric cone programs, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones, Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones, An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems, An extension of Chubanov's algorithm to symmetric cones, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, A new infeasible interior-point method based on Darvay's technique for symmetric optimization, An efficient support vector machine learning method with second-order cone programming for large-scale problems, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, Jordan-algebraic aspects of optimization: randomization, Several Jordan-algebraic aspects of optimization†, Complexity of the primal–dual path-following algorithms for the weighted determinant maximization problems with linear matrix inequalities in the narrow neighbourhood
Cites Work
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Similarity and other spectral relations for symmetric cones
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- An Interior-Point Method for Semidefinite Programming
- A long-step primal--dual algorithm for the symmetric programming problem
- Unnamed Item
- Unnamed Item
