Pages that link to "Item:Q5704068"
From MaRDI portal
The following pages link to Semismooth Matrix-Valued Functions (Q5704068):
Displaying 21 items.
- A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets (Q5255000) (← links)
- Analysis of Symmetric Matrix Valued Functions (Q5297956) (← links)
- A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding (Q5506686) (← links)
- B-Subdifferentials of the Projection onto the Generalized Simplex (Q5865919) (← links)
- On Degenerate Doubly Nonnegative Projection Problems (Q5868954) (← links)
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications (Q6071884) (← links)
- Variational analysis of norm cones in finite dimensional Euclidean spaces (Q6076767) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds (Q6110426) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
- A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold (Q6120009) (← links)
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications (Q6147811) (← links)
- A DCA-Newton method for quartic minimization over the sphere (Q6168057) (← links)
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy (Q6176299) (← links)
- On the differentiability of symmetric matrix valued functions (Q6178246) (← links)
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming (Q6179872) (← links)
- A Corrected Inexact Proximal Augmented Lagrangian Method with a Relative Error Criterion for a Class of Group-Quadratic Regularized Optimal Transport Problems (Q6500198) (← links)
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints (Q6561379) (← links)
- A highly efficient algorithm for solving exclusive lasso problems (Q6640992) (← links)
- Learning graph Laplacian with MCP (Q6640995) (← links)
- On the directional asymptotic approach in optimization theory (Q6665398) (← links)
