A semismooth Newton method for nonlinear symmetric cone programming
DOI10.1007/S00186-012-0393-6zbMATH Open1267.65065OpenAlexW2050993517MaRDI QIDQ1935944FDOQ1935944
Authors: Lingchen Kong, Qingmin Meng 
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
Recommendations
- A smoothing Newton algorithm for circular cone programming
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- A smoothing Newton algorithm for circular cone programming
- A non-smoothing Newton method for nonlinear second-order cone programming
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
Euclidean Jordan algebraquadratic convergencenonlinear symmetric cone programmingsemismooth Newton algorithm
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonlinear programming (90C30)
Cites Work
- On Projection Algorithms for Solving Convex Feasibility Problems
- Title not available (Why is that?)
- A nonsmooth version of Newton's method
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Some P-properties for linear transformations on Euclidean Jordan algebras
- 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
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Clarke generalized Jacobian of the projection onto symmetric cones
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- The primal-dual second-order cone approximations algorithm for symmetric cone programming
- Nonsmooth Equations: Motivation and Algorithms
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
Cited In (13)
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
- Title not available (Why is that?)
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- Title not available (Why is that?)
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- An inexact modified Newton method for VISCC and application in grasping force
- Some structural properties of a Newton-type method for semidefinite programs
- An inexact semismooth Newton method for variational inequality with symmetric cone constraints
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- Projection onto simplicial cones by a semi-smooth Newton method
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
Uses Software
This page was built for publication: A semismooth Newton method for nonlinear symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1935944)
