A nonmonotone smoothing Newton method for circular cone programming
From MaRDI portal
Publication:2836100
DOI10.1080/02331934.2016.1217861zbMath1351.90149OpenAlexW2545912665MaRDI QIDQ2836100
Zhi Bin Zhu, Xiaoni Chi, Liu-yang Yuan, Zhong-Ping Wan
Publication date: 7 December 2016
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331934.2016.1217861
strict complementaritynonmonotone line searchsmoothing Newton methodnondegeneracycircular cone prgoramming
Related Items (6)
Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems. ⋮ Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones ⋮ Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm ⋮ Improved convergence analysis of a smoothing Newton method for the circular cone programming ⋮ No Gap Second-Order Optimality Conditions for Circular Conic Programs ⋮ A new smoothing-type algorithm for nonlinear weighted complementarity problem
Cites Work
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- A one-step smoothing Newton method for second-order cone programming
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the second-order cone complementarity problem
- On cone of nonsymmetric positive semidefinite matrices
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Applications of second-order cone programming
- Second-order cone programming
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A full-Newton step feasible interior-point algorithm for \(P_\ast(\kappa)\)-linear complementarity problems
- A homogeneous interior-point algorithm for nonsymmetric convex conic optimization
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- A nonsmooth version of Newton's method
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Perturbation analysis of second-order cone programming problems
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- Three classes of merit functions for the complementarity problem over a closed convex cone
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- Semismooth and Semiconvex Functions in Constrained Optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Variational analysis of circular cone programs
- Towards non-symmetric conic optimization
- A new nonmonotone line search technique for unconstrained optimization
- Constructions of complementarity functions and merit functions for circular cone complementarity problem
This page was built for publication: A nonmonotone smoothing Newton method for circular cone programming
