Pages that link to "Item:Q4785866"
From MaRDI portal
The following pages link to Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results (Q4785866):
Displaying 36 items.
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function (Q430950) (← links)
- Inexact non-interior continuation method for monotone semidefinite complementarity problems (Q694179) (← 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)
- Analysis of symmetric matrix valued functions. I (Q928580) (← links)
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem (Q942413) (← links)
- A non-interior-point smoothing method for variational inequality problem (Q966082) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- Lower-order penalization approach to nonlinear semidefinite programming (Q995945) (← links)
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem (Q1021504) (← links)
- Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
- A numerical method for computing the principal square root of a matrix (Q1724326) (← links)
- Low-order penalty equations for semidefinite linear complementarity problems (Q1790191) (← links)
- On the convergence of augmented Lagrangian methods for nonlinear semidefinite programming (Q1928305) (← 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)
- Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems (Q2219444) (← links)
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions (Q2430462) (← links)
- Equivalence of two nondegeneracy conditions for semidefinite programs (Q2483041) (← links)
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions (Q2487853) (← links)
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem (Q2490328) (← links)
- Solving semidefinite programming problems via alternating direction methods (Q2493944) (← links)
- Approximate augmented Lagrangian functions and nonlinear semidefinite programs (Q2505379) (← links)
- Global convergence of modified augmented Lagrangian methods for nonlinear semidefinite programming (Q2636605) (← links)
- A new smooth NCP function for solving semidefinite nonlinear complementarity problems (Q2682769) (← links)
- A method for weighted projections to the positive definite cone (Q3453401) (← links)
- The Convergence of a Levenberg–Marquardt Method for Nonlinear Inequalities (Q3514746) (← links)
- PREDICTOR–CORRECTOR SMOOTHING NEWTON METHOD FOR SOLVING SEMIDEFINITE PROGRAMMING (Q3633327) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470655) (← links)
- A sequential quadratic penalty method for nonlinear semidefinite programming (Q4470658) (← links)
- Analysis of Symmetric Matrix Valued Functions (Q5297956) (← links)
- A relaxed logarithmic barrier method for semidefinite programming (Q5501874) (← links)
- Updating the singular value decomposition (Q5893867) (← links)
- IPRSDP: a primal-dual interior-point relaxation algorithm for semidefinite programming (Q6498407) (← links)
