Non-interior continuation methods for solving semidefinite complementarity problems

From MaRDI portal
Publication:1396829

DOI10.1007/s10107-002-0306-1zbMath1023.90046OpenAlexW2142124856MaRDI QIDQ1396829

Xin Chen, Paul Tseng

Publication date: 13 July 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-002-0306-1



Related Items

A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, A non-interior continuation algorithm for solving the convex feasibility problem, Analysis of Symmetric Matrix Valued Functions, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, A globally convergent Levenberg-Marquardt method for the least \(l_2\)-norm solution of nonlinear inequalities, A convex quadratic semi-definite programming approach to the partial additive constant problem in multidimensional scaling, A predictor-corrector smoothing method for second-order cone programming, Some structural properties of a Newton-type method for semidefinite programs, Analysis of a smoothing method for symmetric conic linear programming, Properties of the augmented Lagrangian in nonlinear semidefinite optimization, Convergence of a non-interior continuation algorithm for the monotone SCCP, Continuity, differentiability and semismoothness of generalized tensor functions, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, A regularized smoothing Newton method for solving the symmetric cone complementarity problem, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, A new smooth NCP function for solving semidefinite nonlinear complementarity problems, Solvability of implicit semidefinite and implicit copositive 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, A globally convergent filter-type trust region method for semidefinite programming, Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets, A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property, Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems, A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem, Analysis of symmetric matrix valued functions. I, An introduction to a class of matrix cone programming, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search, Exceptional family and solvability of copositive complementarity problems, A smoothing-type algorithm for solving system of inequalities, Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem, A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP, Equilibrium Conditions of a Logistics Service Supply Chain with a New Smoothing Algorithm, Extension of smoothing functions to symmetric cone complementarity problems, Analysis of a non-interior continuation method for second-order cone programming, Solvability of semidefinite complementarity problems, The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem, A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties, 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, Extension of smoothing Newton algorithms to solve linear programming over symmetric cones, Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs, Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions, The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems, Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem, Smooth convex approximation to the maximum eigenvalue function, A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities, A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem, Low-order penalty equations for semidefinite linear complementarity problems, A new one-step smoothing newton method for the second-order cone complementarity problem, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING, A smoothing method for second order cone complementarity problem, \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem, A projection and contraction method for symmetric cone complementarity problem, Three classes of merit functions for the complementarity problem over a closed convex cone, A smoothing Newton method with a mixed line search for monotone weighted complementarity problems, Inexact non-interior continuation method for solving large-scale monotone SDCP, A new noninterior continuation method for solving a system of equalities and inequalities, Complementarity problems with respect to Loewnerian cones, An interior point parameterized central path following algorithm for linearly constrained convex programming, B-subdifferential of the projection onto the generalized spectraplex


Uses Software