Pages that link to "Item:Q1396829"

The following pages link to Non-interior continuation methods for solving semidefinite complementarity problems (Q1396829):

Displaying 50 items.

• An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
• A regularized smoothing Newton method for solving the symmetric cone complementarity problem (Q409946) (← links)
• Semidefinite complementarity reformulation for robust Nash equilibrium problems with Euclidean uncertainty sets (Q452335) (← links)
• Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search (Q479230) (← links)
• Extension of smoothing Newton algorithms to solve linear programming over symmetric cones (Q545466) (← links)
• Convergence of a non-interior continuation algorithm for the monotone SCCP (Q601939) (← links)
• Exceptional family and solvability of copositive complementarity problems (Q662097) (← links)
• Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← links)
• The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems (Q702592) (← links)
• A smoothing Newton method with a mixed line search for monotone weighted complementarity problems (Q782310) (← links)
• A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets (Q829878) (← links)
• Some structural properties of a Newton-type method for semidefinite programs (Q852154) (← links)
• Analysis of a smoothing method for symmetric conic linear programming (Q854421) (← links)
• Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) (← links)
• Analysis of symmetric matrix valued functions. I (Q928580) (← links)
• A smoothing-type algorithm for solving system of inequalities (Q939536) (← links)
• Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
• Analysis of a non-interior continuation method for second-order cone programming (Q949295) (← links)
• A non-interior-point smoothing method for variational inequality problem (Q966082) (← links)
• Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
• A smoothing self-adaptive Levenberg-Marquardt algorithm for solving system of nonlinear inequalities (Q984338) (← links)
• A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem (Q990536) (← links)
• A smoothing method for second order cone complementarity problem (Q1019772) (← links)
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
• The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem (Q1026684) (← links)
• Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
• Non-interior continuation method for solving the monotone semidefinite complementarity problem (Q1401571) (← links)
• A non-interior continuation algorithm for solving the convex feasibility problem (Q1634140) (← links)
• A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem (Q1724458) (← links)
• Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
• Smooth convex approximation to the maximum eigenvalue function (Q1777442) (← links)
• Low-order penalty equations for semidefinite linear complementarity problems (Q1790191) (← links)
• Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity (Q1928546) (← links)
• Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming (Q1938082) (← links)
• A globally convergent filter-type trust region method for semidefinite programming (Q1955230) (← links)
• \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex (Q2057228) (← links)
• An interior point parameterized central path following algorithm for linearly constrained convex programming (Q2113635) (← links)
• B-subdifferential of the projection onto the generalized spectraplex (Q2115259) (← links)
• Solvability of implicit semidefinite and implicit copositive complementarity problems (Q2196041) (← links)
• A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property (Q2216184) (← links)
• Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems (Q2219444) (← links)
• Extension of the LP-Newton method to conic programming problems via semi-infinite representation (Q2225528) (← links)
• A new noninterior continuation method for solving a system of equalities and inequalities (Q2336560) (← links)
• Complementarity problems with respect to Loewnerian cones (Q2349522) (← links)
• A globally convergent Levenberg-Marquardt method for the least \(l_2\)-norm solution of nonlinear inequalities (Q2379033) (← links)
• A predictor-corrector smoothing method for second-order cone programming (Q2380858) (← links)
• Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions (Q2430462) (← links)
• An introduction to a class of matrix cone programming (Q2452376) (← links)
• Extension of smoothing functions to symmetric cone complementarity problems (Q2466456) (← links)
• Solvability of semidefinite complementarity problems (Q2474860) (← links)