Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
From MaRDI portal
Publication:4785866
DOI10.1137/S1052623401390525zbMath1029.90052OpenAlexW2031981531MaRDI QIDQ4785866
Christian Kanzow, Christian Nagel
Publication date: 5 January 2003
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623401390525
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Optimality conditions and duality in mathematical programming (90C46) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A method for weighted projections to the positive definite cone, Analysis of Symmetric Matrix Valued Functions, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming, Some structural properties of a Newton-type method for semidefinite programs, Analysis of a smoothing method for symmetric conic linear programming, A trust region method for solving semidefinite programs, On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, A new smooth NCP function for solving semidefinite nonlinear complementarity problems, The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, Differential properties of the symmetric matrix-valued Fischer-Burmeister function, A globally convergent filter-type trust region method for semidefinite programming, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, A numerical method for computing the principal square root of a matrix, Analysis of symmetric matrix valued functions. I, Updating the singular value decomposition, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, Inexact non-interior continuation method for monotone semidefinite complementarity problems, Equivalence of two nondegeneracy conditions for semidefinite programs, A non-interior-point smoothing method for variational inequality problem, Smoothing algorithms for complementarity problems over symmetric cones, Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, Solving semidefinite programming problems via alternating direction methods, Approximate augmented Lagrangian functions and nonlinear semidefinite programs, Lower-order penalization approach to nonlinear semidefinite programming, Low-order penalty equations for semidefinite linear complementarity problems, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, A sequential quadratic penalty method for nonlinear semidefinite programming, A sequential quadratic penalty method for nonlinear semidefinite programming, Inexact non-interior continuation method for solving large-scale monotone SDCP, A relaxed logarithmic barrier method for semidefinite programming
