A semismooth Newton method for nonlinear symmetric cone programming
From MaRDI portal
Publication:1935944
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.
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
Cites work
- A nonsmooth version of Newton's method
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Clarke generalized Jacobian of the projection onto symmetric cones
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- Jordan-algebraic aspects of nonconvex optimization over symmetric cones
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Nonsmooth Equations: Motivation and Algorithms
- On Projection Algorithms for Solving Convex Feasibility Problems
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Optimization and nonsmooth analysis
- Semismooth and Semiconvex Functions in Constrained Optimization
- Some P-properties for linear transformations on Euclidean Jordan algebras
- 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
Cited in
(13)- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Extension of the LP-Newton method to conic programming problems via semi-infinite representation
- An inexact modified Newton method for VISCC and application in grasping force
- Projection onto simplicial cones by a semi-smooth Newton method
- An inexact semismooth Newton method for variational inequality with symmetric cone constraints
- scientific article; zbMATH DE number 6513624 (Why is no real title available?)
- A SemiSmooth Newton Method for Semidefinite Programs and its Applications in Electronic Structure Calculations
- A Feasible Semismooth Gauss-Newton Method for Solving a Class of SLCPs
- scientific article; zbMATH DE number 7352423 (Why is no real title available?)
- Semismooth Reformulation and Nonsmooth Newton’s Method for Solving Nonlinear Semidefinite Programming
- A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem
- An approximate gradient-type method for nonlinear symmetric equations with convex constraints
- Some structural properties of a Newton-type method for semidefinite programs
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)
