Pages that link to "Item:Q5704113"

The following pages link to Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems (Q5704113):

Displaying 19 items.

• Solution analysis for the pseudomonotone second-order cone linear complementarity problem (Q2817242) (← links)
• A Sequential Convex Program Approach to an Inverse Linear Semidefinite Programming Problem (Q2821091) (← links)
• Some geometrical aspects of semidefinite linear complementarity problems (Q3377956) (← links)
• Convergence Analysis of Sample Average Approximation of Two-Stage Stochastic Generalized Equations (Q4620415) (← links)
• (Q4642621) (← links)
• Inverse and implicit function theorems for<i>H</i>-differentiable and semismooth functions (Q4657701) (← links)
• An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications (Q5003212) (← links)
• Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian (Q5217598) (← links)
• Constrained Best Euclidean Distance Embedding on a Sphere: A Matrix Optimization Approach (Q5252588) (← links)
• On the characterizations of solutions to perturbed <i>l</i>₁ conic optimization problem (Q5384607) (← links)
• Properties and simplifications of constitutive time‐discretized elastoplastic operators (Q5415429) (← links)
• An efficient algorithm for second-order cone linear complementarity problems (Q5418485) (← links)
• A Krylov Subspace Method for Large-Scale Second-Order Cone Linear Complementarity Problem (Q5502096) (← links)
• A Convex Matrix Optimization for the Additive Constant Problem in Multidimensional Scaling with Application to Locally Linear Embedding (Q5506686) (← links)
• Subdifferential‐based implicit return‐mapping operators in computational plasticity (Q6065078) (← links)
• On the weak second-order optimality condition for nonlinear semidefinite and second-order cone programming (Q6098236) (← links)
• A Riemannian Proximal Newton Method (Q6202763) (← links)
• An effective smoothing Newton projection algorithm for finding sparse solutions to NP-hard tensor complementarity problems (Q6582027) (← links)
• Facial approach for constructing stationary points for mathematical programs with cone complementarity constraints (Q6667558) (← links)