Merit functions for semi-definite complementarity problems
From MaRDI portal
Publication:1290658
zbMath0920.90135MaRDI QIDQ1290658
Publication date: 3 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Fischer-Burmeister functiongap functionmerit functionscone of block-diagonal symmetric positive semi-definite real matricesimplicit Lagrangiansemi-definite complementarity problems
Related Items (61)
Exact augmented Lagrangian functions for nonlinear semidefinite programming ⋮ Douglas-Rachford splitting method for semidefinite programming ⋮ An inexact non-interior continuation method for semidefinite programming: convergence analysis and numerical results ⋮ A globally convergent Levenberg-Marquardt method for the least \(l_2\)-norm solution of nonlinear inequalities ⋮ Some structural properties of a Newton-type method for semidefinite programs ⋮ On the coerciveness of some merit functions for complementarity problems over symmetric cones ⋮ Two classes of merit functions for the second-order cone complementarity problem ⋮ A trust region method for solving semidefinite programs ⋮ A perturbation approach for an inverse quadratic programming problem ⋮ Smooth and nonsmooth analyses of vector-valued functions associated with circular cones ⋮ Stationary point conditions for the FB merit function associated with symmetric cones ⋮ Nonsingularity of FB system and constraint nondegeneracy in semidefinite programming ⋮ A new smooth NCP function for solving semidefinite nonlinear complementarity problems ⋮ Solvability of implicit semidefinite and implicit copositive complementarity problems ⋮ On some interconnections between strict monotonicity, globally uniquely solvable, and \(P\) properties in semidefinite linear complementarity problems. ⋮ Differential properties of the symmetric matrix-valued Fischer-Burmeister function ⋮ Monotonicity of Löwner operators and its applications to symmetric cone complementarity problems ⋮ A sufficient condition that has no exceptional family of elements for SDCP ⋮ A globally convergent filter-type trust region method for semidefinite programming ⋮ A novel neural network for solving semidefinite programming problems with some applications ⋮ Convergence analysis on matrix splitting iteration algorithm for semidefinite linear complementarity problems ⋮ The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming ⋮ A continuous trust-region-type method for solving nonlinear semidefinite complementarity problem ⋮ Analysis of symmetric matrix valued functions. I ⋮ Exceptional family and solvability of copositive complementarity problems ⋮ A new approximation of the matrix rank function and its application to matrix rank minimization ⋮ Orthogonal Nonnegative Tucker Decomposition ⋮ The \(SC^1\) property of the squared norm of the SOC Fischer-Burmeister function ⋮ On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem ⋮ A novel neural network model for solving a class of nonlinear semidefinite programming problems ⋮ Solvability of semidefinite complementarity problems ⋮ The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem ⋮ The same growth of FB and NR symmetric cone complementarity functions ⋮ Inexact non-interior continuation method for monotone semidefinite complementarity problems ⋮ Equivalence of two nondegeneracy conditions for semidefinite programs ⋮ Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem ⋮ Lipschitz continuity of the solution mapping of symmetric cone complementarity problems ⋮ Smoothing algorithms for complementarity problems over symmetric cones ⋮ Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs ⋮ Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions ⋮ The bounded smooth reformulation and a trust region algorithm for semidefinite complementarity problems ⋮ Some P-properties for linear transformations on Euclidean Jordan algebras ⋮ Cartesian \(P\)-property and its applications to the semidefinite linear complementarity problem ⋮ On merit functions for \(p\)-order cone complementarity problem ⋮ A note on the Lipschitz continuity of the gradient of the squared norm of the matrix-valued Fischer-Burmeister function ⋮ A proximal gradient descent method for the extended second-order cone linear complementarity problem ⋮ Solving semidefinite programming problems via alternating direction methods ⋮ A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems ⋮ An infeasible interior point method for the monotone SDLCP based on a transformation of the central path ⋮ A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem ⋮ Low-order penalty equations for semidefinite linear complementarity problems ⋮ Constructions of complementarity functions and merit functions for circular cone complementarity problem ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ A regularization method for the second-order cone complementarity problem with the Cartesian \(P_0\)-property ⋮ The decompositions with respect to two core non-symmetric cones ⋮ A one-parametric class of merit functions for the symmetric cone complementarity problem ⋮ The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem ⋮ 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 ⋮ Inexact non-interior continuation method for solving large-scale monotone SDCP ⋮ An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
This page was built for publication: Merit functions for semi-definite complementarity problems
