Polyhedral Newton-min algorithms for complementarity problems
From MaRDI portal
complementarity problemglobal convergenceleast-squares merit functionlinesearchminimum functionnonsmooth reformulationP-matrixpolyhedral Newton-min algorithmquadratic convergencesemismooth Newton
Newton-type methods (49M15) Numerical methods based on nonlinear programming (49M37) Numerical mathematical programming methods (65K05) 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) Methods of successive quadratic programming type (90C55)
Cites work
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A new iterative method for discrete HJB equations
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- A Nonmonotone Line Search Technique for Newton’s Method
- A nonsmooth version of Newton's method
- A Partition Theorem for Euclidean n-Space
- A pathsearch damped Newton method for computing general equilibria
- A penalized Fischer-Burmeister NCP-function
- A polynomial projection algorithm for linear feasibility problems
- A posteriori error estimates for a compositional two-phase flow with nonlinear complementarity constraints
- A sampling Kaczmarz-Motzkin algorithm for linear feasibility
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- A theoretical and numerical comparison of some semismooth algorithms for complementarity problems
- A unified approach to interior point algorithms for linear complementary problems
- Adaptive inexact semismooth Newton methods for the contact problem between two membranes
- Additive Schwarz algorithm for the nonlinear complementarity problem with \(M\)-function
- An algorithmic characterization of P-matricity
- An Algorithmic Characterization of P-matricity II: Adjustments, Refinements, and Validation
- Complementarity problems
- Complementary pivot theory of mathematical programming
- Computation of generalized differentials in nonlinear complementarity problems
- Computational complexity of complementary pivot methods
- Computational complexity of LCPs associated with positive definite symmetric matrices
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Engineering and Economic Applications of Complementarity Problems
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Exact computation of an error bound for the balanced linear complementarity problem with unique solution
- EXTENSION OF NEWTON AND QUASI-NEWTON METHODS TO SYSTEMS OF PC^1 EQUATIONS
- Feasible corrector-predictor interior-point algorithm for \(P_* (\kappa)\)-linear complementarity problems based on a new search direction
- Feasible descent algorithms for mixed complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- Formulating dynamic multi-rigid-body contact problems with friction as solvable linear complementarity problems
- Fully coupled generalized hybrid-mixed finite element approximation of two-phase two-component flow in porous media. I: Formulation and properties of the mathematical model
- Gas phase appearance and disappearance as a problem with complementarity constraints
- Generalized complementarity problem
- Generalized Newton's method based on graphical derivatives
- Global complexity bound analysis of the Levenberg-Marquardt method for nonsmooth equations and its application to the nonlinear complementarity problem
- Global Newton-type methods and semismooth reformulations for NCP
- Globally Convergent Newton Methods for Nonsmooth Equations
- Handbook of applied optimization
- scientific article; zbMATH DE number 6610411 (Why is no real title available?)
- scientific article; zbMATH DE number 4147426 (Why is no real title available?)
- scientific article; zbMATH DE number 5720488 (Why is no real title available?)
- scientific article; zbMATH DE number 192986 (Why is no real title available?)
- scientific article; zbMATH DE number 757678 (Why is no real title available?)
- scientific article; zbMATH DE number 2201293 (Why is no real title available?)
- scientific article; zbMATH DE number 3381785 (Why is no real title available?)
- Interfaces to PATH 3.0: Design, implementation and usage
- Linear complementarity since 1978
- Local analysis of Newton-type methods for variational inequalities and nonlinear programming
- Local structure of feasible sets in nonlinear programming, Part III: Stability and sensitivity
- Merit functions for complementarity and related problems: a survey
- Minimization of functions having Lipschitz continuous first partial derivatives
- Monotone (nonlinear) operators in Hilbert space
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- New NCP-functions and their properties
- Newton and quasi-Newton methods for normal maps with polyhedral sets
- Newton's Method for B-Differentiable Equations
- Newton's method for linear complementarity problems
- Newton-Type Methods for Optimization and Variational Problems
- Non-isothermal compositional liquid gas Darcy flow: formulation, soil-atmosphere boundary condition and application to high-energy geothermal simulations
- Nonconvergence of the plain Newton-min algorithm for linear complementarity problems with a P-matrix
- Nonlinear Programs with Positively Bounded Jacobians
- Nonsmooth mechanics. Models, dynamics and control
- Normal Maps Induced by Linear Transformations
- NP-completeness of the linear complementarity problem
- Numerical methods for nonsmooth dynamical systems. Applications in mechanics and electronics
- Numerical optimization. Theoretical and practical aspects. Transl. from the French
- Numerical optimization. Theoretical and practice aspects
- On a semi-smooth Newton method and its globalization
- On concepts of directional differentiability
- On construction of new NCP functions
- On finite termination of an iterative method for linear complementarity problems
- On NCP-functions
- On quasidifferentiable mappings
- On the B-differential of the componentwise minimum of two affine vector functions
- On the complexity of computing the handicap of a sufficient matrix
- On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
- On the local convergence of quasi-Newton methods for nonlinear complementarity problems
- Optimization and nonsmooth analysis
- Perturbation Analysis of a Condition Number for Linear Systems
- PRACTICAL POLYNOMIAL TIME ALGORITHMS FOR LINEAR COMPLEMENTARITY PROBLEMS
- Primal-dual active set method for pricing American better-of option on two assets
- Properties and construction of NCP functions
- Semi-smooth Newton methods for nonlinear complementarity formulation of compositional two-phase flow in porous media
- Strongly Regular Generalized Equations
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- The Linear Complementarity Problem
- The Primal-Dual Active Set Strategy as a Semismooth Newton Method
- The Relaxation Method for Linear Inequalities
- The Relaxation Method for Solving Systems of Linear Inequalities
- The semismooth Newton method for the solution of reactive transport problems including mineral precipitation-dissolution reactions
This page was built for publication: Polyhedral Newton-min algorithms for complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6873501)
