An inexact interior point method for monotone NCP

DOI10.1080/10556789908805752zbMath1028.90084OpenAlexW2082453120MaRDI QIDQ4504782

Maria Macconi, Stefania Bellavia

Publication date: 14 September 2000

Published in: Optimization Methods and Software (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/10556789908805752

zbMATH Keywords

multiobjective optimizationPareto optimal solutionsinversion algorithmconditional probability density functionfuzzy set of feasible solutionsgeophysical nonlinear inverse problems

Mathematics Subject Classification ID

Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)

Related Items (3)

Infeasible interior-point algorithms based on sampling average approximations for a class of stochastic complementarity problems and their applications ⋮ A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems ⋮ An Infeasible Interior-Point Method with Nonmonotonic Complementarity Gaps

Cites Work

• Unnamed Item
• Unnamed Item
• Global convergence in infeasible-interior-point algorithms
• Inexact interior-point method
• Interior-point methods for nonlinear complementarity problems
• Inexact Newton Methods
• Globally Convergent Inexact Newton Methods
• A Quadratically Convergent Infeasible-Interior-Point Algorithm for LCP with Polynomial Complexity
• An Infeasible Path-Following Method for Monotone Complementarity Problems
• Engineering and Economic Applications of Complementarity Problems
• Global Linear and Local Quadratic Convergence of a Long-Step Adaptive-Mode Interior Point Method for Some Monotone Variational Inequality Problems

This page was built for publication: An inexact interior point method for monotone NCP