A O(1/k^3/2) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
From MaRDI portal
Publication:725814
complexityhybrid proximal extra-gradientinterior point methodsmonotone complementarity problemprimal-dual
Monotone operators and generalizations (47H05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Newton-type methods (49M15) Numerical methods for variational inequalities and related problems (65K15) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51) Abstract computational complexity for mathematical programming problems (90C60)
Recommendations
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- Interior-point methods for nonlinear complementarity problems
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- An interior proximal point algorithm for nonlinear complementarity problems
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
Cites work
- -enlargements of maximal monotone operators in Banach spaces
- A dual algorithm for the solution of nonlinear variational problems via finite element approximation
- A family of enlargements of maximal monotone operators
- A hybrid approximate extragradient-proximal point algorithm using the enlargement of a maximal monotone operator
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A new polynomial-time algorithm for linear programming
- A quadratically convergent polynomial long-step algorithm for A class of nonlinear monotone complementarity problems*
- A UNIFIED FRAMEWORK FOR SOME INEXACT PROXIMAL POINT ALGORITHMS*
- An inexact interior point method for monotone NCP
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Convex analysis and monotone operator theory in Hilbert spaces
- Enlargement of monotone operators with applications to variational inequalities
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- scientific article; zbMATH DE number 3534286 (Why is no real title available?)
- scientific article; zbMATH DE number 3574917 (Why is no real title available?)
- scientific article; zbMATH DE number 3637614 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- scientific article; zbMATH DE number 1369459 (Why is no real title available?)
- scientific article; zbMATH DE number 1862745 (Why is no real title available?)
- scientific article; zbMATH DE number 3341597 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- Interior-point methods for nonlinear complementarity problems
- Iteration-complexity of a Newton proximal extragradient method for monotone variational inequalities and inclusion problems
- Iteration-complexity of block-decomposition algorithms and the alternating direction method of multipliers
- Monotone (nonlinear) operators in Hilbert space
- Monotone Operators and the Proximal Point Algorithm
- Newton's method for the nonlinear complementarity problem: a B- differentiable equation approach
- On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean
- On the maximal monotonicity of subdifferential mappings
- On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
- Polynomiality of primal-dual affine scaling algorithms for nonlinear complementarity problems
- Splitting Algorithms for the Sum of Two Nonlinear Operators
- Test examples for nonlinear programming codes
Cited in
(6)- On the complexity of a hybrid proximal extragradient projective method for solving monotone inclusion problems
- Neuro-swarm intelligent computing paradigm for nonlinear HIV infection model with CD4+ T-cells
- Interior hybrid proximal extragradient methods for the linear monotone complementarity problem
- A discrete dynamics approach to sparse calculation and applied in ontology science
- Iteration-complexity of a Rockafellar's proximal method of multipliers for convex programming based on second-order approximations
- A Douglas--Rachford Type Primal-Dual Method for Solving Inclusions with Mixtures of Composite and Parallel-Sum Type Monotone Operators
This page was built for publication: A \(\mathcal O(1/k^{3/2})\) hybrid proximal extragradient primal-dual interior point method for nonlinear monotone mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q725814)
