A nonmonotone smoothing Newton method for circular cone programming
From MaRDI portal
Recommendations
- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- Improved convergence analysis of a smoothing Newton method for the circular cone programming
- A smoothing Newton algorithm for circular cone programming
- A smoothing Newton algorithm for circular cone programming
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
Cites work
- A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones
- 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
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A new nonmonotone line search technique for unconstrained optimization
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems
- A nonsmooth version of Newton's method
- A one-parametric class of merit functions for the second-order cone complementarity problem
- A one-step smoothing Newton method for second-order cone programming
- A polynomial-time interior-point method for circular cone programming based on kernel functions
- A primal barrier function phase I algorithm for nonsymmetric conic optimization problems
- A smoothing-type algorithm for the second-order cone complementarity problem with a new nonmonotone line search
- Applications of second-order cone programming
- Constructions of complementarity functions and merit functions for circular cone complementarity problem
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- On cone of nonsymmetric positive semidefinite matrices
- Perturbation analysis of second-order cone programming problems
- Primal-dual interior-point algorithms for convex quadratic circular cone optimization
- Second-order cone programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Smoothing algorithms for complementarity problems over symmetric cones
- Smoothing functions for second-order-cone complementarity problems
- Strong semismoothness of the Fischer-Burmeister SDC and SOC complementarity functions
- Three classes of merit functions for the complementarity problem over a closed convex cone
- Towards non-symmetric conic optimization
- Variational analysis of circular cone programs
Cited in
(12)- Smoothing Newton algorithm for the circular cone programming with a nonmonotone line search
- A new smoothing-type algorithm for nonlinear weighted complementarity problem
- Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
- Penalized NCP-functions for nonlinear complementarity problems and a scaling algorithm
- A smoothing Newton algorithm for circular cone programming
- Improved convergence analysis of a smoothing Newton method for the circular cone programming
- A new non-interior point algorithm for circular cone programming
- A smoothing Newton algorithm for circular cone programming
- No gap second-order optimality conditions for circular conic programs
- Augmented Lagrangian method for nonlinear circular conic programs: a local convergence analysis
- An interior-point derivative-free algorithm for nonlinear complementarity problems
- Smoothing inexact Newton method based on a new derivative-free nonmonotone line search for the NCP over circular cones
This page was built for publication: A nonmonotone smoothing Newton method for circular cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2836100)
