A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
From MaRDI portal
Publication:4651970
DOI10.1137/S1052623400379620zbMath1079.90094OpenAlexW2015113450MaRDI QIDQ4651970
Publication date: 23 February 2005
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s1052623400379620
nonsmooth optimizationNewton's methodsemidefinite programmingmatrix equationssemidefinite complementarity problem
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Methods of quasi-Newton type (90C53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A penalty method for generalized Nash equilibrium problems, An inexact smoothing method for the monotone complementarity problem over symmetric cones, An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results, Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector, On the coerciveness of some merit functions for complementarity problems over symmetric cones, Properties of the augmented Lagrangian in nonlinear semidefinite optimization, Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity, A modified alternating direction method for convex quadratically constrained quadratic semidefinite programs, A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems, A Nonmonotone Smoothing-Type Algorithm for a System of Inequalities Associated with Circular Cones, Quadratic model updating with gyroscopic structure from partial eigendata, Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming, Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions, A proximal point algorithm for the monotone second-order cone complementarity problem, On duality theory for non-convex semidefinite programming, Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions, Sparse recovery on Euclidean Jordan algebras, A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities, An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities, Inverse semidefinite quadratic programming problem with \(l_1\) norm measure, A smoothing Newton method for a type of inverse semi-definite quadratic programming problem, 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, Differentiability and semismoothness properties of integral functions and their applications, A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function, Nonsingularity in second-order cone programming via the smoothing metric projector, Smoothing methods for nonsmooth, nonconvex minimization, Lower-order penalization approach to nonlinear semidefinite programming, Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects, An alternating direction method for solving convex nonlinear semidefinite programming problems, A perturbation approach for an inverse quadratic programming problem over second-order cones, Inexact non-interior continuation method for solving large-scale monotone SDCP, On filter-successive linearization methods for nonlinear semidefinite programming
