Equations on monotone graphs
From MaRDI portal
Publication:378122
DOI10.1007/s10107-011-0509-4zbMath1287.49017OpenAlexW2000722217MaRDI QIDQ378122
Publication date: 11 November 2013
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-011-0509-4
variational inequalityimplicit functioncomplementaritymonotone graphnormal manifoldnormal mapvariational condition
Sensitivity, stability, well-posedness (49K40) Variational inequalities (49J40) Sensitivity, stability, parametric optimization (90C31) Set-valued and variational analysis (49J53) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
Reduction of affine variational inequalities, Full stability of general parametric variational systems, Generic Minimizing Behavior in Semialgebraic Optimization, Solving equilibrium problems using extended mathematical programming, Clarke Subgradients for Directionally Lipschitzian Stratifiable Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Semi-algebraic functions have small subdifferentials
- Piecewise affine bijections of \(\mathbb R^n\), and the equation \(Sx^ +- Tx^ -=y\)
- The dimension of semialgebraic subdifferential graphs
- Relationships of properties of piecewise affine maps over ordered fields
- Normal fans of polyhedral convex sets
- Failure of metric regularity for major classes of variational systems
- Robinson's implicit function theorem and its extensions
- Asymptotic behavior of statistical estimators and of optimal solutions of stochastic optimization problems
- Monotone (nonlinear) operators in Hilbert space
- Asymptotic properties of statistical estimators in stochastic programming
- Branching numbers for Euclidean projections onto convex polyhedra
- Lipschitzian inverse functions, directional derivatives, and applications in \(C^{1,1}\) optimization
- Structural analysis of nonsmooth mappings, inverse functions, and metric projections
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Sensitivity analysis of composite piecewise smooth equations
- A proof of the branching number bound for normal manifolds
- On concepts of directional differentiability
- Manifestations of the Schur complement
- Localized normal maps and the stability of variational conditions
- The Fritz John necessary optimality conditions in the presence of equality and inequality constraints
- On the number of solutions to the complementarity problem and spanning properties of complementary cones
- Solution Sensitivity from General Principles
- Lipschitzian Multifunctions and a Lipschitzian Inverse Mapping Theorem
- A point-of-attraction result for Newton's method with point-based approximations
- Implicit Functions and Solution Mappings
- Local structure of feasible sets in nonlinear programming, part II: Nondegeneracy
- Strongly Regular Generalized Equations
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- Normal Maps Induced by Linear Transformations
- On Piecewise Affine Mappings in $R^n $
- On branching numbers of normal manifolds
- Variational Analysis
- Asymptotic Theory for Solutions in Statistical Estimation and Stochastic Programming
- Characterizations of Strong Regularity for Variational Inequalities over Polyhedral Convex Sets
- On a Generalization of a Normal Map and Equation
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Equilibrium Points of Bimatrix Games
- Convex Analysis
- On the basic theorem of complementarity
- Piecewise-Linear Theory of Nonlinear Networks
- Constraint Nondegeneracy in Variational Analysis
- A Partition Theorem for Euclidean n-Space
- Mathematical Programs with Equilibrium Constraints
