Euclidean Jordan algebras and interior-point algorithms
From MaRDI portal
Publication:1383772
DOI10.1023/A:1009701824047zbMath0973.90095MaRDI QIDQ1383772
Publication date: 2 December 2001
Published in: Positivity (Search for Journal in Brave)
Related Items
A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, A new extension of Chubanov's method to symmetric cones, 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, A long-step interior-point algorithm for symmetric cone Cartesian P*(κ)-HLCP, 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 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, An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones, 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, Unnamed Item, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP∗(κ)-LCP 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 infeasible full NT-step interior point method for circular optimization, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, Rank computation in Euclidean Jordan algebras, A path following interior-point method for linear complementarity problems over circular cones, A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming, 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, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, 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, Estimation of normal covariance matrices parametrized by irreducible symmetric cones under Stein's loss, Two wide neighborhood interior-point methods for symmetric cone optimization, A new infeasible-interior-point algorithm for linear programming over symmetric cones, Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone, Convergence of a non-interior continuation algorithm for the monotone SCCP, 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, Primal-dual potential reduction algorithm for symmetric programming problems with nonlinear objective functions, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, Polynomial time solvability of non-symmetric semidefinite programming, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems, A semismooth Newton method for nonlinear symmetric cone programming, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, 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 convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems, 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, A smoothing Newton method for second-order cone optimization based on a new smoothing function, An extension of Chubanov's algorithm to symmetric cones, 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 weighted-path-following method for symmetric cone linear complementarity problems, Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones, 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 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, 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, A polynomial primal-dual affine scaling algorithm for symmetric conic optimization, Improved smoothing Newton methods for symmetric cone complementarity problems, The same growth of FB and NR symmetric cone complementarity functions, A new class of complementarity functions for symmetric cone complementarity problems, Smoothing algorithms for complementarity problems over symmetric cones, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Some P-properties for linear transformations on Euclidean Jordan algebras, On self-regular IPMs (with comments and rejoinder), 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 smoothing-type Newton method for second-order cone programming problems based on a new smooth function, A new one-step smoothing Newton method for second-order cone programming., Gaddum's test for symmetric cones, Bilinear optimality constraints for the cone of positive polynomials, Jordan algebras and dual affine connections on 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, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, Intrinsic volumes of symmetric cones and applications in convex programming, A new smoothing Newton-type method for second-order cone programming problems, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, On theP*(κ)horizontal linear complementarity problems over Cartesian product of symmetric cones, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, A one-parametric class of merit functions for the symmetric cone complementarity problem, VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, Numerical experiments with universal barrier functions for cones of Chebyshev systems, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, Similarity and other spectral relations for symmetric cones, Three classes of merit functions for the complementarity problem over a closed convex cone, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, 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, Primal-dual interior-point algorithms for convex quadratic circular cone optimization
