Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
type: Item
instance of: scholarly article
title: Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
zbMATH Open document ID: 1254.90167
author: Lingchen Kong
published in: Positivity
publication date: 2013-01-03T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 65K10
zbMATH DE Number: 6121588
zbMATH Keywords: symmetric cone programming
zbMATH Keywords: smoothing Newton method
zbMATH Keywords: Chen-Mangasarian smoothing function
zbMATH Keywords: variational analysis
zbMATH Keywords: quadratic convergence
describes a project that uses: SCCP
MaRDI profile type: Publication
full work available at URL: s11117-011-0126-8
OpenAlex ID: W2079979106
cites work: Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
cites work: Q4503250
cites work: Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
cites work: A Non-Interior-Point Continuation Method for Linear Complementarity Problems
cites work: Smoothing methods for convex inequalities and linear complementarity problems
cites work: Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
cites work: Non-interior continuation methods for solving semidefinite complementarity problems
cites work: The primal-dual second-order cone approximations algorithm for symmetric cone programming
cites work: Optimization and nonsmooth analysis
cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems
cites work: Q4321748
cites work: Euclidean Jordan algebras and interior-point algorithms
cites work: Linear systems in Jordan algebras and primal-dual interior-point algorithms
cites work: Jordan-algebraic aspects of nonconvex optimization over symmetric cones
cites work: Some P-properties for linear transformations on Euclidean Jordan algebras
cites work: Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
cites work: Some Noninterior Continuation Methods for Linear Complementarity Problems
cites work: Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
cites work: The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
cites work: A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
cites work: Clarke generalized Jacobian of the projection onto symmetric cones
cites work: Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
cites work: An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
cites work: Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
cites work: A nonsmooth version of Newton's method
cites work: Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
cites work: Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
cites work: Constraint Nondegeneracy in Variational Analysis
cites work: Variational Analysis
cites work: Q3816922
cites work: Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
cites work: Extension of primal-dual interior point algorithms to symmetric cones
cites work: Sensitivity analysis of generalized equations
cites work: Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
cites work: A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
DOI: 10.1007/S11117-011-0126-8
description: scientific article; zbMATH DE number 6121588