Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
From MaRDI portal
Publication:1928546
Recommendations
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
- A smoothing Newton method for solving the second-order cone programming
- Analysis of a smoothing method for symmetric conic linear programming
- A smoothing Newton method for symmetric cone complementarity problem
- A semismooth Newton method for nonlinear symmetric cone programming
Cites work
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A nonsmooth version of Newton's method
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- Associative and Jordan algebras, and polynomial time interior-point algorithms for symmetric cones.
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- Clarke generalized Jacobian of the projection onto symmetric cones
- Constraint Nondegeneracy in Variational Analysis
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- 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 4088853 (Why is no real title available?)
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 1502618 (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
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Non-interior continuation methods for solving semidefinite complementarity problems
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- Optimization and nonsmooth analysis
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Sensitivity analysis of generalized equations
- Smoothing methods for convex inequalities and linear complementarity problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- 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
- Variational Analysis
Cited in
(15)- A generalized smoothing Newton method for the symmetric cone complementarity problem
- Sub-quadratic convergence of a smoothing Newton algorithm for the P₀- and monotone LCP
- A semismooth Newton method for nonlinear symmetric cone programming
- A nonmonotone smoothing Newton algorithm for weighted complementarity problem
- Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras
- An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
- Solvability based on E-property for the nonlinear symmetric cone complementarity problem
- Quadratic Convergence of Smoothing Newton's Method for 0/1 Loss Optimization
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- Pseudomonotonicity of nonlinear transformations on Euclidean Jordan algebras
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
- Sub-quadratic convergence of a smoothing Newton method for second-order cone programming
- Nonsingularity in second-order cone programming via the smoothing metric projector
This page was built for publication: Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1928546)
