Inexact non-interior continuation method for monotone semidefinite complementarity problems
From MaRDI portal
Publication:694179
DOI10.1007/s11590-011-0337-8zbMath1282.90199OpenAlexW2018991644MaRDI QIDQ694179
Publication date: 11 December 2012
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-011-0337-8
large scale problemsinexact non-interior methodlocal superlinear convergencesemidefinite complementarity problem
Related Items (2)
A new smooth NCP function for solving semidefinite nonlinear complementarity problems ⋮ A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
Cites Work
- Unnamed Item
- The rate of convergence of the augmented Lagrangian method for nonlinear semidefinite programming
- Merit functions for semi-definite complementarity problems
- A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems
- Local convergence of predictor-corrector infeasible-interior-point algorithms for SDPs and SDLCPs
- Topics in semidefinite and interior-point methods
- Non-interior continuation methods for solving semidefinite complementarity problems
- Non-interior continuation method for solving the monotone semidefinite complementarity problem
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- Novel approaches to hard discrete optimization
- A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Matrix Analysis
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- A Global and Local Superlinear Continuation-Smoothing Method forP0andR0NCP or Monotone NCP
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Semidefinite Programs: New Search Directions, Smoothing-Type Methods, and Numerical Results
- Regularization Methods for Semidefinite Programming
- Handbook of semidefinite programming. Theory, algorithms, and applications
- A smoothing inexact Newton method for nonlinear complementarity problems
This page was built for publication: Inexact non-interior continuation method for monotone semidefinite complementarity problems