Semismooth Matrix-Valued Functions
From MaRDI portal
Recommendations
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- scientific article; zbMATH DE number 7733459
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Semismoothness of Spectral Functions
Cited in
(only showing first 100 items - show all)- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- Inverse semidefinite quadratic programming problem with \(l_1\) norm measure
- A dual adaptive algorithm for matrix optimization with sparse group Lasso regularization
- Constrained best Euclidean distance embedding on a sphere: a matrix optimization approach
- Inverse and implicit function theorems forH-differentiable and semismooth functions
- A globally convergent filter-type trust region method for semidefinite programming
- Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications
- An equivalency condition of nonsingularity in nonlinear semidefinite programming
- An accelerated active-set algorithm for a quadratic semidefinite program with general constraints
- An efficient sieving-based secant method for sparse optimization problems with least-squares constraints
- An inexact semismooth Newton-based augmented Lagrangian algorithm for multi-task Lasso problems
- B-subdifferentials of the projection onto the generalized simplex
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- Coercivity and strong semismoothness of the penalized Fischer-Burmeister function for the symmetric cone complementarity problem
- An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces
- B-subdifferential of the projection onto the generalized spectraplex
- A new approximation of the matrix rank function and its application to matrix rank minimization
- An inexact smoothing method for the monotone complementarity problem over symmetric cones
- Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints
- Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications
- Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems
- Properties of the augmented Lagrangian in nonlinear semidefinite optimization
- Unified convergence analysis of a second-order method of multipliers for nonlinear conic programming
- On efficiently solving the subproblems of a level-set method for fused lasso problems
- Spectral operators of matrices
- A nonmonotone active-set semismooth Newton method for matrix approximation with group regularization
- An inexact SQP Newton method for convex SC\(^{1}\) minimization problems
- Complementarity problems with respect to Loewnerian cones
- The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem
- Penalized complementarity functions on symmetric cones
- Differential properties of the symmetric matrix-valued Fischer-Burmeister function
- Smoothing algorithms for complementarity problems over symmetric cones
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Optimality conditions in semidefinite programming
- A superlinearly convergent smoothing Newton continuation algorithm for variational inequalities over definable sets
- New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors
- A convex matrix optimization for the additive constant problem in multidimensional scaling with application to locally linear embedding
- Continuity, differentiability and semismoothness of generalized tensor functions
- A DCA-Newton method for quartic minimization over the sphere
- The higher-order derivatives of spectral functions
- Inverse quadratic programming problem with \(l_1\) norm measure
- On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications
- An augmented Lagrangian method for a class of Inverse quadratic programming problems
- An algorithm based on resolvent operators for solving positively semidefinite variational inequalities
- The Z-eigenvalues of a symmetric tensor and its application to spectral hypergraph theory.
- Computing the best approximation over the intersection of a polyhedral set and the doubly nonnegative cone
- On properties of the bilinear penalty function method for mathematical programs with semidefinite cone complementarity constraints
- An augmented Lagrangian primal-dual semismooth Newton method for multi-block composite optimization
- Variational analysis of norm cones in finite dimensional Euclidean spaces
- Proximal gradient/semismooth Newton methods for projection onto a polyhedron via the duality-gap-active-set strategy
- Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming
- Newton-type methods for inverse singular value problems with multiple singular values
- An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results
- Multiple regression for matrix and vector predictors: models, theory, algorithms, and beyond
- An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
- On the stable solution of large scale problems over the doubly nonnegative cone
- A unified approach to spectral and isotropic functions
- First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints
- A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds
- A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming
- Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions
- A partial proximal point algorithm for nuclear norm regularized matrix least squares problems
- Some characterizations for SOC-monotone and SOC-convex functions
- Quadratic growth conditions for convex matrix optimization problems associated with spectral functions
- Properties associated with the epigraph of the l₁ norm function of projection onto the nonnegative orthant
- On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems.
- Spectral operators of matrices: semismoothness and characterizations of the generalized Jacobian
- Equivalence of two nondegeneracy conditions for semidefinite programs
- A smoothing Newton method for a type of inverse semi-definite quadratic programming problem
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- On degenerate doubly nonnegative projection problems
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Certifying the global optimality of quartic minimization over the sphere
- Some structural properties of a Newton-type method for semidefinite programs
- An efficient augmented Lagrangian method for support vector machine
- Efficient sparse semismooth Newton methods for the clustered Lasso problem
- Solving the OSCAR and SLOPE models using a semismooth Newton-based augmented Lagrangian method
- A regularized semi-smooth Newton method with projection steps for composite convex programs
- On cone of nonsymmetric positive semidefinite matrices
- Inexact non-interior continuation method for solving large-scale monotone SDCP
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- The convex and monotone functions associated with second-order cone
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A stochastic semismooth Newton method for nonsmooth nonconvex optimization
- \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex
- Variational properties of matrix functions via the generalized matrix-fractional function
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- An entropy-regularized ADMM for binary quadratic programming
- Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- A highly efficient algorithm for solving exclusive lasso problems
- Learning graph Laplacian with MCP
- Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming
- A trust region method for solving semidefinite programs
- On the semismoothness of projection mappings and maximum eigenvalue functions
- On characterizations of \(\mathbf P\)- and \(\mathbf P_ 0\)-properties in nonsmooth functions.
- Conditional quadratic semidefinite programming: examples and methods
- Generalized Newton algorithms for tilt-stable minimizers in nonsmooth optimization
- Computing the degrees of freedom of rank-regularized estimators and cousins
This page was built for publication: Semismooth Matrix-Valued Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5704068)
