Pages that link to "Item:Q5704068"
From MaRDI portal
The following pages link to Semismooth Matrix-Valued Functions (Q5704068):
Displaying 50 items.
- Newton-type methods for inverse singular value problems with multiple singular values (Q311676) (← links)
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results (Q312194) (← links)
- Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant (Q328535) (← links)
- A trust region method for solving semidefinite programs (Q354640) (← links)
- On the second-order directional derivatives of singular values of matrices and symmetric matrix-valued functions (Q368462) (← links)
- Approximation of rank function and its application to the nearest low-rank correlation matrix (Q386463) (← links)
- Smooth and nonsmooth analyses of vector-valued functions associated with circular cones (Q387138) (← links)
- On the stable solution of large scale problems over the doubly nonnegative cone (Q403648) (← links)
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications (Q445463) (← links)
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions (Q456990) (← links)
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints (Q463746) (← links)
- A new approximation of the matrix rank function and its application to matrix rank minimization (Q481777) (← links)
- Conditional quadratic semidefinite programming: examples and methods (Q489109) (← links)
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems (Q495943) (← links)
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints (Q499161) (← links)
- Derivatives of compound matrix valued functions (Q499225) (← links)
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints (Q526392) (← links)
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming (Q535069) (← links)
- A perturbation approach for an inverse quadratic programming problem (Q607673) (← links)
- Newton's method for computing the nearest correlation matrix with a simple upper bound (Q620444) (← links)
- An equivalency condition of nonsingularity in nonlinear semidefinite programming (Q625675) (← links)
- Nonnegative inverse eigenvalue problems with partial eigendata (Q664539) (← links)
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems (Q711698) (← links)
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors (Q747767) (← links)
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems (Q839325) (← links)
- Some structural properties of a Newton-type method for semidefinite programs (Q852154) (← links)
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem (Q858580) (← links)
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization (Q868537) (← links)
- The higher-order derivatives of spectral functions (Q884422) (← links)
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming (Q927160) (← links)
- Analysis of symmetric matrix valued functions. I (Q928580) (← links)
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming (Q938410) (← links)
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem (Q953410) (← links)
- An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces (Q955644) (← links)
- Smoothing algorithms for complementarity problems over symmetric cones (Q967217) (← links)
- On cone of nonsymmetric positive semidefinite matrices (Q979007) (← links)
- An augmented Lagrangian method for a class of Inverse quadratic programming problems (Q989969) (← links)
- Coercivity and strong semismoothness of the penalized Fischer-Burmeister function for the symmetric cone complementarity problem (Q1035920) (← links)
- Some characterizations for SOC-monotone and SOC-convex functions (Q1037358) (← links)
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones (Q1040694) (← links)
- Inexact non-interior continuation method for solving large-scale monotone SDCP (Q1044421) (← links)
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems. (Q1405049) (← links)
- A regularized semi-smooth Newton method with projection steps for composite convex programs (Q1668726) (← links)
- On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization (Q1694779) (← links)
- The vector-valued functions associated with circular cones (Q1724508) (← links)
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming (Q1741120) (← 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)
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure (Q1987439) (← links)
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints (Q2026764) (← links)