Linear systems in Jordan algebras and primal-dual interior-point algorithms
From MaRDI portal
Publication:1378999
DOI10.1016/S0377-0427(97)00153-2zbMath0889.65066MaRDI QIDQ1378999
Publication date: 7 April 1998
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Related Items
Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P*(κ) nonlinear complementarity problems over symmetric cones, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function, A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming, Linear fractional optimization problems on Jordan Euclidean algebras, Jordan Algebras of Symmetric Matrices, Approximation hierarchies for copositive cone over symmetric cone and their comparison, Doubly autoparallel structure and curvature integrals. Applications to iteration complexity for solving convex programs, A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones, Interior-point algorithm for symmetric cone horizontal linear complementarity problems based on a new class of algebraically equivalent transformations, A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, Extension of primal-dual interior point methods to diff-convex problems on symmetric cones, An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, A long-step primal--dual algorithm for the symmetric programming problem, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, 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, Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP*(κ)-LCP Over Symmetric Cones, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A projection and contraction method for symmetric cone complementarity problem, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP over symmetric cones, Unnamed Item, Infeasible path-following interior point algorithm for Cartesian P*(κ) nonlinear complementarity problems over symmetric cones, Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, On the central paths in symmetric cone programming, An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, 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, Exceptional family and solvability of the second-order cone complementarity problems, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, Rank computation in Euclidean Jordan algebras, Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log ϵ−1) iteration complexity, A method for weighted projections to the positive definite cone, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, Derivatives of eigenvalues and Jordan frames, Euclidean Jordan Algebras and Strongly Regular Graphs, Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions, Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems, Analysis of a smoothing method for symmetric conic linear programming, A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization, Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones, Two wide neighborhood interior-point methods for symmetric cone optimization, A new infeasible-interior-point algorithm for linear programming over symmetric cones, Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs, Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming, An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, Dimension reduction for semidefinite programs via Jordan algebras, A new corrector-predictor interior-point method for symmetric cone optimization, Curvature integrals and iteration complexities in SDP and symmetric cone programs, A semismooth Newton method for nonlinear symmetric cone programming, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization, A regularized smoothing Newton method for solving the symmetric cone complementarity problem, A corrector–predictor path-following method for second-order cone optimization, Several Jordan-algebraic aspects of optimization†, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones, New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP, The \(Q\) method for symmetric cone programming, On the convergence properties of a smoothing approach for mathematical programs with symmetric cone complementarity constraints, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, A Corrector-Predictor Interior-Point Algorithm for P∗(κ)-HLCPs Over Cartesian Product of Symmetric Cones, A new infeasible interior-point method based on Darvay's technique for symmetric optimization, A homogeneous smoothing-type algorithm for symmetric cone linear programs, A weighted-path-following method for symmetric cone linear complementarity problems, An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming, A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones, An infeasible full-NT step interior point algorithm for CQSCO, A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems, On the approximate augmented Lagrangian for nonlinear symmetric cone programming, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, Improved smoothing Newton methods for symmetric cone complementarity problems, A new class of complementarity functions for symmetric cone complementarity problems, Smoothing algorithms for complementarity problems over symmetric cones, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Unnamed Item, Some P-properties for linear transformations on Euclidean Jordan algebras, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Penalized complementarity functions on symmetric cones, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, Gaddum's test for symmetric cones, Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, A new class of smoothing complementarity functions over symmetric cones, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP*(κ) horizontal linear complementarity problems over symmetric cones, On max-\(k\)-sums, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, A one-parametric class of merit functions for the symmetric cone complementarity problem, A corrector-predictor arc search interior-point algorithm for symmetric optimization, Similarity and other spectral relations for symmetric cones, A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones, Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search, 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, SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, On the optimal parameter of a self-concordant barrier over a symmetric cone, On Hazan's algorithm for symmetric programming problems, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, On a commutative class of search directions for linear programming over symmetric cones
Cites Work
