Some continuity properties of polyhedral multifunctions

DOI10.1007/BFB0120929MaRDI QIDQ3896861zbMATH OpenOpenAlexFDO

Authors Stephen M. Robinson

Publication date 1981

Published in Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/bfb0120929

zbMATH Keywords

continuity propertieslinear complementarityparametric programmingpolyhedral convex setspolyhedral multifunctions

Mathematics Subject Classification ID

Set-valued maps in general topology (54C60) Sensitivity, stability, parametric optimization (90C31) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited in

(only showing first 100 items - show all)

• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
• Scenario tree modeling for multistage stochastic programs
• Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
• More results on the convergence of iterative methods for the symmetric linear complementarity problem
• Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton
• Proto-differentiability of set-valued mappings and its applications in optimization
• Global error bounds for monotone affine variational inequality problems
• Sensitivity analysis for nonsmooth generalized equations
• On a global error bound for a class of monotone affine variational inequality problems
• Modified proximal point algorithm for extended linear-quadratic programming
• Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity
• Error bounds and convergence analysis of feasible descent methods: A general approach
• Gauss-Seidel method for least-distance problems
• A degree-theoretic approach to parametric nonsmooth equations with multivalued perturbed solution sets
• A new smoothing-regularization approach for a maximum-likelihood estimation problem
• On the structure of convex piecewise quadratic functions
• New improved error bounds for the linear complementarity problem
• Error bounds for analytic systems and their applications
• Error bounds for inconsistent linear inequalities and programs
• Error bounds in mathematical programming
• Convergence analysis of perturbed feasible descent methods
• A reduction method for variational inequalities
• Improved generalization via tolerant training
• A trust region algorithm for nonlinear bilevel programming
• Error bounds for the solution sets of quadratic complementarity problems
• Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems
• A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem
• Critical multipliers in variational systems via second-order generalized differentiation
• Stability of possibly nonisolated solutions of constrained equations, with applications to complementarity and equilibrium problems
• A unified approach to error bounds for structured convex optimization problems
• Recent contributions to linear semi-infinite optimization
• On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization
• Nonmonotone gradient methods for vector optimization with a portfolio optimization application
• Linear convergence of the randomized sparse Kaczmarz method
• Recent contributions to linear semi-infinite optimization: an update
• Convergence of the augmented decomposition algorithm
• Necessary optimality conditions for implicit control systems with applications to control of differential algebraic equations
• Metric subregularity in generalized equations
• Bilevel road pricing: theoretical analysis and optimality conditions
• Weakly upper Lipschitz multifunctions and applications in parametric optimization
• Calculus of the exponent of Kurdyka-Łojasiewicz inequality and its applications to linear convergence of first-order methods
• Verifiable sufficient conditions for the error bound property of second-order cone complementarity problems
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• Some recent advances in projection-type methods for variational inequalities
• Error estimates and Lipschitz constants for best approximation in continuous function spaces
• Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines
• Sensitivity analysis for generalized linear-quadratic problems
• Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction
• On regular coderivatives in parametric equilibria with non-unique multipliers
• Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems
• Convergence rates for an inexact ADMM applied to separable convex optimization
• Kurdyka-Łojasiewicz property of zero-norm composite functions
• A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing
• Affine minimax variational inequalities and matrix two-person games
• On the quantitative solution stability of parameterized set-valued inclusions
• Correction to: ``Kurdyka-Łojasiewicz property of zero-norm composite functions
• Constrained Lipschitzian error bounds and noncritical solutions of constrained equations
• An efficient Hessian based algorithm for singly linearly and box constrained least squares regression
• On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives
• Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems
• A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems
• Primal superlinear convergence of SQP methods in piecewise linear-quadratic composite optimization
• Perturbation techniques for convergence analysis of proximal gradient method and other first-order algorithms via variational analysis
• Calmness and calculus: two basic patterns
• Calmness of a perturbed Cournot Oligopoly Game with nonsmooth cost functions
• Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs
• On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints
• Projection-based local and global Lipschitz moduli of the optimal value in linear programming
• An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems
• Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry
• Augmented Lagrangian methods for convex matrix optimization problems
• Estimates of generalized hessians for optimal value functions in mathematical programming
• An investigation on semismooth Newton based augmented Lagrangian method for image restoration
• Subdifferentials and stability analysis of feasible set and Pareto front mappings in linear multiobjective optimization
• The radius of metric subregularity
• Superlinear convergence of the sequential quadratic method in constrained optimization
• Optimization and discrete approximation of sweeping processes with controlled moving sets and perturbations
• Convergence rates for boundedly regular systems
• A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems
• Complementary problems with polynomial data
• Calmness of the argmin mapping in linear semi-infinite optimization
• On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope
• Second-order variational analysis in second-order cone programming
• New analysis of linear convergence of gradient-type methods via unifying error bound conditions
• Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system
• A new complementarity function and applications in stochastic second-order cone complementarity problems
• Lipschitz modulus of the optimal value in linear programming
• Computation of graphical derivatives of normal cone maps to a class of conic constraint sets
• On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming
• On calmness of the argmin mapping in parametric optimization problems
• Optimality conditions for sparse nonlinear programming
• Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints
• On the convergence of iterative methods for symmetric linear complementarity problems
• Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
• Inclusions in general spaces: Hoelder stability, solution schemes and Ekeland's principle
• On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function
• Strong metric subregularity of mappings in variational analysis and optimization
• A short proof of the sticky face lemma
• On M-stationarity conditions in MPECs and the associated qualification conditions
• Necessary optimality conditions and exact penalization for non-Lipschitz nonlinear programs

This page was built for publication: Some continuity properties of polyhedral multifunctions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3896861)