A semismooth Newton method for nonlinear symmetric cone programming
type: Item
instance of: scholarly article
title: A semismooth Newton method for nonlinear symmetric cone programming
zbMATH Open document ID: 1267.65065
author: Lingchen Kong
author: Qingmin Meng
published in: Mathematical Methods of Operations Research
publication date: 2013-02-20T00:00:00Z
review text: The authors employ the projection operator to design a semismooth Newton algorithm for solving nonlinear symmetric cone programming of the following form \[ \min f(x)\qquad\text{s.t.}\;Ax= q,\quad x\in K. \] The algorithm is computable from the theoretical standpoint and is proved to be locally quadratically convergent.
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C25
zbMATH DE Number: 6137608
zbMATH Keywords: Euclidean Jordan algebra
zbMATH Keywords: nonlinear symmetric cone programming
zbMATH Keywords: semismooth Newton algorithm
zbMATH Keywords: quadratic convergence
reviewed by: Hans Benker
describes a project that uses: SCCP
MaRDI profile type: Publication
full work available at URL: s00186-012-0393-6
OpenAlex ID: W2050993517
cites work: On Projection Algorithms for Solving Convex Feasibility 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: On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone 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: An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
cites work: Semismooth and Semiconvex Functions in Constrained Optimization
cites work: Nonsmooth Equations: Motivation and Algorithms
cites work: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
cites work: A nonsmooth version of Newton's method
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: Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
DOI: 10.1007/S00186-012-0393-6
description: scientific article; zbMATH DE number 6137608