Semismooth Matrix-Valued Functions
From MaRDI portal
Publication:5704068
DOI10.1287/moor.27.1.150.342zbMath1082.49501OpenAlexW2127930751MaRDI QIDQ5704068
Publication date: 11 November 2005
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.27.1.150.342
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Nonsmooth analysis (49J52)
Related Items (only showing first 100 items - show all)
Strong Variational Sufficiency for Nonlinear Semidefinite Programming and Its Implications ⋮ Variational analysis of norm cones in finite dimensional Euclidean spaces ⋮ An entropy-regularized ADMM for binary quadratic programming ⋮ A semismooth Newton based augmented Lagrangian method for nonsmooth optimization on matrix manifolds ⋮ A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming ⋮ A penalty-free infeasible approach for a class of nonsmooth optimization problems over the Stiefel manifold ⋮ Perturbation analysis of the Euclidean distance matrix optimization problem and its numerical implications ⋮ A DCA-Newton method for quartic minimization over the sphere ⋮ 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 ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An inexact smoothing method for the monotone complementarity problem over symmetric cones ⋮ Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method ⋮ Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems ⋮ Analysis of Symmetric Matrix Valued Functions ⋮ 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 ⋮ Correlation stress testing for value-at-risk: an unconstrained convex optimization approach ⋮ An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems ⋮ Some structural properties of a Newton-type method for semidefinite programs ⋮ Properties associated with the epigraph of the \(l_1\) norm function of projection onto the nonnegative orthant ⋮ The semismooth-related properties of a merit function and a descent method for the nonlinear complementarity problem ⋮ Certifying the global optimality of quartic minimization over the sphere ⋮ Augmented Lagrangian methods for convex matrix optimization problems ⋮ A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations ⋮ A trust region method for solving semidefinite programs ⋮ Properties of the augmented Lagrangian in nonlinear semidefinite optimization ⋮ On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems ⋮ A regularized semi-smooth Newton method with projection steps for composite convex programs ⋮ On the second-order directional derivatives of singular values of matrices and symmetric matrix-valued functions ⋮ The Z -eigenvalues of a symmetric tensor and its application to spectral hypergraph theory ⋮ Continuity, differentiability and semismoothness of generalized tensor functions ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ Computing the degrees of freedom of rank-regularized estimators and cousins ⋮ Approximation of rank function and its application to the nearest low-rank correlation matrix ⋮ Smooth and nonsmooth analyses of vector-valued functions associated with circular cones ⋮ The higher-order derivatives of spectral functions ⋮ Spectral operators of matrices ⋮ Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions ⋮ On the stable solution of large scale problems over the doubly nonnegative cone ⋮ Newton's method for computing the nearest correlation matrix with a simple upper bound ⋮ Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming ⋮ A new smooth NCP function for solving semidefinite nonlinear complementarity problems ⋮ An equivalency condition of nonsingularity in nonlinear semidefinite programming ⋮ On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization ⋮ On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems. ⋮ A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems ⋮ On sensitivity analysis of nonsmooth multidisciplinary optimization problems in engineering process line applications ⋮ A globally convergent filter-type trust region method for semidefinite programming ⋮ Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions ⋮ First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints ⋮ An efficient augmented Lagrangian method for support vector machine ⋮ The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming ⋮ The vector-valued functions associated with circular cones ⋮ Analysis of symmetric matrix valued functions. I ⋮ An introduction to a class of matrix cone programming ⋮ A new approximation of the matrix rank function and its application to matrix rank minimization ⋮ Nonnegative inverse eigenvalue problems with partial eigendata ⋮ On the semismoothness of projection mappings and maximum eigenvalue functions ⋮ Conditional quadratic semidefinite programming: examples and methods ⋮ A note on convergence analysis of an SQP-type method for nonlinear semidefinite programming ⋮ A partial proximal point algorithm for nuclear norm regularized matrix least squares problems ⋮ QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming ⋮ SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints ⋮ Derivatives of compound matrix valued functions ⋮ A Unified Approach to Spectral and Isotropic Functions ⋮ Inverse semidefinite quadratic programming problem with \(l_1\) norm measure ⋮ Inverse quadratic programming problem with \(l_1\) norm measure ⋮ An algorithm based on resolvent operators for solving positively semidefinite variational inequalities ⋮ A smoothing Newton method for a type of inverse semi-definite quadratic programming problem ⋮ An algorithm based on resolvent operators for solving variational inequalities in Hilbert spaces ⋮ Strong stationarity for optimization problems with complementarity constraints in absence of polyhedricity. With applications to optimization with semidefinite and second-order-cone complementarity constraints ⋮ Inverse and implicit function theorems forH-differentiable and semismooth functions ⋮ Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming ⋮ Equivalence of two nondegeneracy conditions for semidefinite programs ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions ⋮ Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem ⋮ On cone of nonsymmetric positive semidefinite matrices ⋮ Penalized complementarity functions on symmetric cones ⋮ An inexact SQP Newton method for convex SC\(^{1}\) minimization problems ⋮ A projected semismooth Newton method for problems of calibrating least squares covariance matrix ⋮ An accelerated active-set algorithm for a quadratic semidefinite program with general constraints ⋮ An augmented Lagrangian method for a class of Inverse quadratic programming problems ⋮ An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ Projection Methods in Conic Optimization ⋮ Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian ⋮ New fractional error bounds for polynomial systems with applications to Hölderian stability in optimization and spectral theory of tensors ⋮ \(\mathrm{B}\)-subdifferentials of the projection onto the matrix simplex ⋮ Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem ⋮ Isolated calmness of solution mappings and exact recovery conditions for nuclear norm optimization problems ⋮ Generalized Newton Algorithms for Tilt-Stable Minimizers in Nonsmooth Optimization ⋮ Coercivity and strong semismoothness of the penalized Fischer-Burmeister function for the symmetric cone complementarity problem ⋮ Some characterizations for SOC-monotone and SOC-convex functions ⋮ A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones ⋮ Computing the Best Approximation over the Intersection of a Polyhedral Set and the Doubly Nonnegative Cone ⋮ A Stochastic Semismooth Newton Method for Nonsmooth Nonconvex Optimization ⋮ Inexact non-interior continuation method for solving large-scale monotone SDCP
This page was built for publication: Semismooth Matrix-Valued Functions
