Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
From MaRDI portal
Publication:1928546
DOI10.1007/s11117-011-0126-8zbMath1254.90167OpenAlexW2079979106MaRDI QIDQ1928546
Publication date: 3 January 2013
Published in: Positivity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11117-011-0126-8
quadratic convergencevariational analysissmoothing Newton methodsymmetric cone programmingChen-Mangasarian smoothing function
Numerical mathematical programming methods (65K05) Convex programming (90C25) Numerical optimization and variational techniques (65K10) Sensitivity, stability, parametric optimization (90C31)
Related Items
Some P-properties of the quadratic representations and automorphism invariance in Euclidean Jordan algebras, Solvability based on E-property for the nonlinear symmetric cone complementarity problem, Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones, A generalized smoothing Newton method for the symmetric cone complementarity problem, Pseudomonotonicity of nonlinear transformations on Euclidean Jordan algebras, An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, A nonmonotone smoothing Newton algorithm for weighted complementarity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equivalent conditions for Jacobian nonsingularity in linear symmetric cone programming
- 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
- Non-interior continuation methods for solving semidefinite complementarity problems
- Extension of primal-dual interior point algorithms to symmetric cones
- Sensitivity analysis of generalized equations
- Smoothing methods for convex inequalities and linear complementarity problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- 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
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Constraint Nondegeneracy, Strong Regularity, and Nonsingularity in Semidefinite Programming
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Optimization and nonsmooth analysis
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Semismooth and Semiconvex Functions in Constrained Optimization
- Nondegeneracy and Quantitative Stability of Parameterized Optimization Problems with Multiple Solutions
- Variational Analysis
- Analysis of Nonsmooth Symmetric-Matrix-Valued Functions with Applications to Semidefinite Complementarity Problems
- A Squared Smoothing Newton Method for Nonsmooth Matrix Equations and Its Applications in Semidefinite Optimization Problems
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Quadratic Convergence of a Nonsmooth Newton-Type Method for Semidefinite Programs Without Strict Complementarity
- Automorphism Invariance of P- and GUS-Properties of Linear Transformations on Euclidean Jordan Algebras
- An Interior‐Point Trust‐Region Algorithm for General Symmetric Cone Programming
- Constraint Nondegeneracy in Variational Analysis
