Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
From MaRDI portal
Publication:3124038
DOI10.1137/S1052623494269035zbMath0872.90098OpenAlexW2075379600MaRDI QIDQ3124038
Kojima, Masakazu, Susumu Shindoh, Shinji Hara
Publication date: 11 March 1997
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623494269035
Convex programming (90C25) Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A modified infeasible interior-point algorithm with full-Newton step for semidefinite optimization, Conic convex programming and self-dual embedding, A method for weighted projections to the positive definite cone, A Lipschitzian error bound for monotone symmetric cone linear complementarity problem, Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function, Full Nesterov–Todd step feasible interior-point method for the CartesianP*(κ)-SCLCP, Convergence to a second-order critical point by a primal-dual interior point trust-region method for nonlinear semidefinite programming, THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS, Three‐dimensional Mohr–Coulomb limit analysis using semidefinite programming, Fast implementation for semidefinite programs with positive matrix completion, A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS, Unnamed Item, A corrector–predictor path-following algorithm for semidefinite optimization, Unnamed Item, Estimation of Positive Semidefinite Correlation Matrices by Using Convex Quadratic Semidefinite Programming, A limiting analysis on regularization of singular SDP and its implication to infeasible interior-point algorithms, New complexity analysis of a full Nesterov–Todd step interior-point method for semidefinite optimization, A wide neighbourhood primal-dual second-order corrector interior point algorithm for semidefinite optimization, Corrector-predictor interior-point method with new search direction for semidefinite optimization, A Geodesic Interior-Point Method for Linear Optimization over Symmetric Cones, A class of new search directions for full-NT step feasible interior point method in semidefinite optimization, A full NT-step infeasible interior-point algorithm for semidefinite optimization, $LDL^T$ Direction Interior Point Method for Semidefinite Programming, A logarithm barrier method for semi-definite programming, SDPT3 — A Matlab software package for semidefinite programming, Version 1.3, SOLVING STRONGLY MONOTONE LINEAR COMPLEMENTARITY PROBLEMS, An efficient algorithm for second-order cone linear complementarity problems, Semidefinite programming and combinatorial optimization, Implementation of interior point methods for mixed semidefinite and second order cone optimization problems, Global optimization in protein docking using clustering, underestimation and semidefinite programming, Limiting behavior of the Alizadeh–Haeberly–Overton weighted paths in semidefinite programming, New complexity analysis of the primal-dual method for semidefinite optimization based on the Nesterov-Todd direction, A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization, A robust algorithm for semidefinite programming, Interior-point methods for CartesianP*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions, Positive semidefinite relaxations for distance geometry problems., Self-Regular Interior-Point Methods for Semidefinite Optimization, The State-of-the-Art in Conic Optimization Software, Latest Developments in the SDPA Family for Solving Large-Scale SDPs, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, SEQUENTIAL SEMIDEFINITE PROGRAMMING FOR OPTIMIZATION OF FRAMED STRUCTURES UNDER MULTIMODAL BUCKLING CONSTRAINTS, Some geometrical aspects of semidefinite linear complementarity problems, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, A new second-order Mehrotra-type predictor-corrector algorithm for SDO, A new wide neighbourhood primal-dual interior-point algorithm for semidefinite optimization, A primal-dual interior-point method based on a new kernel function for linear complementarity problem, A primal-dual interior point trust-region method for nonlinear semidefinite programming, Unnamed Item, A relaxed logarithmic barrier method for semidefinite programming, A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem, Low-rank exploitation in semidefinite programming for control, A study of search directions in primal-dual interior-point methods for semidefinite programming, A note on the Nesterov-Todd and the Kojima-Shindoh-hara search directions in semidefinite programming, On long-step predictor-corrector interior-point algorithm for semidefinite programming with Monteiro-Zhang unified search directions, Implementation of primal-dual methods for semidefinite programming based on Monteiro and Tsuchiya Newton directions and their variants, A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming, Sdpha: a Matlab implementation of homogeneous interior-point algorithms for semidefinite programming, New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming, Search directions and convergence analysis of some infeasibnle path-following methods for the monoton semi-definite lcp∗, A primal–dual regularized interior-point method for semidefinite programming, Credible autocoding of convex optimization algorithms, The parameter-Newton iteration for the second-order cone linear complementarity problem, 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 constraint-reduced algorithm for semidefinite optimization problems with superlinear convergence, A new wide-neighborhood predictor-corrector interior-point method for semidefinite optimization, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, Incomplete orthogonalization preconditioners for solving large and dense linear systems which arise from semidefinite programming, An interior-point algorithm for semidefinite least-squares problems., Semidefinite programming for uncertain linear equations in static analysis of structures, A feasible primal-dual interior point method for linear semidefinite programming, An \(\epsilon\)-sensitivity analysis for semidefinite programming, A modified homogeneous potential reduction algorithm for solving the monotone semidefinite linear complementarity problem, A conversion of an SDP having free variables into the standard form SDP, Exploiting sparsity in primal-dual interior-point methods for semidefinite programming, Error bounds in mathematical programming, Nonlinear semidefinite programming: sensitivity, convergence, and an application in passive reduced-order modeling, A homotopy method for nonlinear semidefinite programming, An arc-search predictor-corrector infeasible-interior-point algorithm for \(P_\ast(\kappa)\)-SCLCPs, Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs, A wide neighborhood interior-point algorithm for convex quadratic semidefinite optimization, A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function, A second order Mehrotra-type predictor-corrector algorithm for semidefinite optimization, A primal-dual interior-point method based on various selections of displacement step for symmetric optimization, An infeasible interior-point algorithm for stochastic second-order cone optimization, A new second-order corrector interior-point algorithm for semidefinite programming, Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones, On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems., Asymptotic behavior of underlying NT paths in interior point methods for monotone semidefinite linear complementarity problems, Local and superlinear convergence of a primal-dual interior point method for nonlinear semidefinite programming, On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function, A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO, A novel neural network for solving semidefinite programming problems with some applications, On the extension of an arc-search interior-point algorithm for semidefinite optimization, An interior point method with a primal-dual quadratic barrier penalty function for nonlinear semidefinite programming, Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones, Primal-dual interior-point algorithm for convex quadratic semi-definite optimization, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, Characterizing \(\mathbf Q\)-linear transformations for semidefinite linear complementarity problems, Homogeneous self-dual algorithms for stochastic second-order cone programming, Semi-definite programming for topology optimization of trusses under multiple eigenvalue constraints, A weighted-path-following method for symmetric cone linear complementarity problems, A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function, A potential reduction algorithm for an extended SDP problem, Confidence ellipsoids for static response of trusses with load and structural uncertainties, A power penalty method for second-order cone nonlinear complementarity problems, A polynomial time constraint-reduced algorithm for semidefinite optimization problems, Numerical algebraic geometry and semidefinite programming, Application of topological degree theory to semi-definite complementarity problem, An \(O(\sqrt nL)\) wide neighborhood interior-point algorithm for semidefinite optimization, Solvability of semidefinite complementarity problems, An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming, An inexact spectral bundle method for convex quadratic semidefinite programming, Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term, Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming, Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence, Asymptotic behavior of the central path for a special class of degenerate SDP problems, Local minima and convergence in low-rank semidefinite programming, Some P-properties for linear transformations on Euclidean Jordan algebras, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, On self-regular IPMs (with comments and rejoinder), Solving semidefinite programming problems via alternating direction methods, A primal-dual interior point method for nonlinear semidefinite programming, Strengthened existence and uniqueness conditions for search directions in semidefinite program\-ming, Underlying paths in interior point methods for the monotone semidefinite linear complementarity problem, An efficient parameterized logarithmic kernel function for semidefinite optimization, An infeasible interior point method for the monotone SDLCP based on a transformation of the central path, An inexact primal-dual path following algorithm for convex quadratic SDP, Low-order penalty equations for semidefinite linear complementarity problems, 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, A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization, An efficient second-order cone programming approach for optimal selection in tree breeding, A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization, An arc-search infeasible interior-point method for semidefinite optimization with the negative infinity neighborhood, A polynomial-iteration infeasible interior-point algorithm with arc-search for semidefinite optimization, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, On the long-step path-following method for semidefinite programming, Superlinear convergence of interior-point algorithms for semidefinite programming, A primal-dual interior-point algorithm with arc-search for semidefinite programming, Simplified full Nesterov-Todd step infeasible interior-point algorithm for semidefinite optimization based on a kernel function, A primal-dual interior point method for parametric semidefinite programming problems, A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming, Affine scaling algorithm fails for semidefinite programming, On the \(P_2'\) and \(P_2\)-properties in the semidefinite linear complementarity problem, Polynomial primal-dual cone affine scaling for semidefinite programming, Symmetric primal-dual path-following algorithms for semidefinite programming, On weighted centers for semidefinite programming, A semidefinite programming approach for the projection onto the cone of negative semidefinite symmetric tensors with applications to solid mechanics, Analyticity of the central path at the boundary point in semidefinite programming, An efficient support vector machine learning method with second-order cone programming for large-scale problems, A long-step primal-dual path-following method for semidefinite programming, Complementarity forms of theorems of Lyapunov and Stein, and related results, Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function, On a commutative class of search directions for linear programming over symmetric cones, Semidefinite programming, A primal-dual interior point method for large-scale free material optimization
