A semismooth Newton method for nonlinear symmetric cone programming
From MaRDI portal
Publication:1935944
DOI10.1007/s00186-012-0393-6zbMath1267.65065MaRDI QIDQ1935944
Publication date: 20 February 2013
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00186-012-0393-6
quadratic convergence; Euclidean Jordan algebra; nonlinear symmetric cone programming; semismooth Newton algorithm
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C30: Nonlinear programming
Related Items
An inexact modified Newton method for VISCC and application in grasping force, An inexact semismooth Newton method for variational inequality with symmetric cone constraints
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Clarke generalized Jacobian of the projection onto symmetric cones
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- A nonsmooth version of Newton's method
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Nonsmooth Equations: Motivation and Algorithms
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- On Projection Algorithms for Solving Convex Feasibility Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
