Extension of primal-dual interior point algorithms to symmetric cones

DOI10.1007/s10107-003-0380-zzbMath1023.90083OpenAlexW2042592476MaRDI QIDQ1404230

Farid Alizadeh, Stefan Schmieta

Publication date: 20 August 2003

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-003-0380-z

zbMATH Keywords

semidefinite programmingEuclidean-Jordan algebraspath-following algorithms

Mathematics Subject Classification ID

Semidefinite programming (90C22) Interior-point methods (90C51) Finite-dimensional structures of Jordan algebras (17C55)

Related Items

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones, Global and global linear convergence of smoothing algorithm for the Cartesian \(P_*(\kappa)\)-SCLCP, Monotonicity and circular cone monotonicity associated with circular cones, On the central paths in symmetric cone programming, An infeasible full NT-step interior point method for circular optimization, An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path, 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, An infeasible interior-point algorithm for linear optimization over Cartesian symmetric cones, An inexact smoothing method for the monotone complementarity problem over symmetric cones, Interior-point methods based on kernel functions for symmetric optimization, Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function, Jordan-algebraic aspects of optimization: randomization, An algorithm for nonsymmetric conic optimization inspired by MOSEK, An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, 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 ϵ⁻¹) iteration complexity, A method for weighted projections to the positive definite cone, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, 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 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, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems, 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, Condition Number Minimization in Euclidean Jordan Algebras, Two wide neighborhood interior-point methods for symmetric cone optimization, The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone, 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, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A note on the paper ``The algebraic structure of the arbitrary-order cone, A Hölder type inequality and an interpolation theorem in Euclidean Jordan algebras, The Jordan algebraic structure of the circular cone, Unnamed Item, A primal-dual interior-point method based on various selections of displacement step for symmetric optimization, A new corrector-predictor interior-point method for symmetric cone optimization, An infeasible interior-point algorithm for stochastic second-order cone optimization, On a box-constrained linear symmetric cone optimization problem, A corrector–predictor path-following method for second-order cone optimization, A new extension of Chubanov's method to symmetric cones, Several Jordan-algebraic aspects of optimization†, Strict double diagonal dominance in Euclidean Jordan algebras, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, 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, Linear complementarity problems over symmetric cones: characterization of \(Q _{b }\)-transformations and existence results, New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function, A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization, 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 new projected Barzilai-Borwein method for the symmetric cone complementarity problem, STEIN LINEAR PROGRAMS OVER SYMMETRIC CONES, A new full-NT step interior-point method for circular cone optimization, A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs, Extension of smoothing functions to symmetric cone complementarity problems, A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP, On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space, 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, 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, Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming, A corrector-predictor path-following method for convex quadratic symmetric cone optimization, A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions, The \(\mathbf Q\)-property of composite transformations and the \(\mathbf P\)-property of Stein-type transformations on self-dual and symmetric cones, A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones, A New Infeasible Interior-Point Method Based on a Non-Coercive Kernel Function with Improved Centering Steps for Second-Order Cone Optimization, Interior-point methods for CartesianP_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems, The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem, 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, An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones, An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem, The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences, The decompositions with respect to two core non-symmetric cones, 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, VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, 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, A corrector-predictor arc search interior-point algorithm for symmetric optimization, Unnamed Item, A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions, New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization, A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity, Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization, Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP_∗(κ)-LCP over symmetric cones, A Riesz-Thorin type interpolation theorem in Euclidean Jordan algebras, SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS, Unnamed Item, On the optimal parameter of a self-concordant barrier over a symmetric cone, Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones, Primal-dual interior-point algorithms for convex quadratic circular cone optimization, A smoothing Newton method for symmetric cone complementarity problem, 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, Unnamed Item, Infeasible interior-point method for symmetric optimization using a positive-asymptotic barrier, Exceptional family and solvability of the second-order cone complementarity problems, An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, A full step infeasible interior-point method for Cartesian \(P_{*}(\kappa)\)-SCLCP, The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems, The algebraic structure of the arbitrary-order cone, A path following interior-point method for linear complementarity problems over circular cones, Decomposition-based interior point methods for stochastic quadratic second-order cone programming, A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones, Schur complements, Schur determinantal and Haynsworth inertia formulas in Euclidean Jordan algebras, Derivatives of eigenvalues and Jordan frames, Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions, A wide neighborhood primal-dual predictor-corrector interior-point method for symmetric cone optimization, Analysis of a smoothing method for symmetric conic linear programming, A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization, Volumetric barrier decomposition algorithms for stochastic quadratic second-order cone programming, An alternating direction method for convex quadratic second-order cone programming with bounded constraints, 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, Convergence of a non-interior continuation algorithm for the monotone SCCP, A logarithmic barrier interior-point method based on majorant functions for second-order cone programming, 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, A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem, New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems, Complexity analysis of a full-{N}ewton step interior-point method for linear optimization, 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, A predictor-corrector smoothing Newton method for symmetric cone complementarity problems, Stationary point conditions for the FB merit function associated with symmetric cones, A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones, Solving conic systems via projection and rescaling, The Hölder continuity of Löwner's operator in Euclidean Jordan algebras, An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming, 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 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, A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization, Minimum eigenvalue inequalities for \(Z\)-transformations on proper and symmetric cones, Full Nesterov-Todd step infeasible interior-point method for symmetric optimization, Enclosing ellipsoids and elliptic cylinders of semialgebraic sets and their application to error bounds in polynomial optimization, A primal-dual interior-point method for optimal grasping manipulation of multi-fingered hand-arm robots, The \(Q\) method for symmetric cone programming, More results on Schur complements in Euclidean Jordan algebras, The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems, 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, The solution set structure of monotone linear complementarity problems over second-order cone, Homogeneous self-dual algorithms for stochastic second-order cone programming, Some inequalities involving determinants, eigenvalues, and Schur complements in Euclidean Jordan algebras, Full-NT step infeasible interior-point method for SOCO based on a specific kernel function, A homogeneous smoothing-type algorithm for symmetric cone linear programs, 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, 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, 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 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, Strict semimonotonicity property of linear transformations on Euclidean Jordan algebras, Smoothing algorithms for complementarity problems over symmetric cones, Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Some P-properties for linear transformations on Euclidean Jordan algebras, Jordan quadratic SSM-property and its relation to copositive linear transformations on Euclidean Jordan algebras, Feasibility and solvability of Lyapunov-type linear programming over symmetric cones, A smoothing-type Newton method for second-order cone programming problems based on a new smooth function, A smoothing Newton method for symmetric cone complementarity problems, On \(Q\) and \(R_0\) properties of a quadratic representation in linear complementarity problems over the second-order cone, A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization, Linear operators and positive semidefiniteness of symmetric tensor spaces, Bilinear optimality constraints for the cone of positive polynomials, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, A new smoothing Newton-type method for second-order cone programming problems, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, A modified LM algorithm for tensor complementarity problems over the circular cone, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, Some inertia theorems in Euclidean Jordan algebras, A one-parametric class of merit functions for the symmetric cone complementarity problem, Strict diagonal dominance and a Geršgorin type theorem in Euclidean Jordan algebras, Positive principal minor property of linear transformations on Euclidean Jordan algebras, Growth behavior of two classes of merit functions for symmetric cone complementarity problems, On the finiteness of the cone spectrum of certain linear transformations on Euclidean Jordan algebras, 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, On approximate solutions for robust semi-infinite multi-objective convex symmetric cone optimization