Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems

DOI10.1137/0325033zbMATH Open0613.90066OpenAlexW1992769584MaRDI QIDQ4721085FDOQ4721085

Authors: Tzong-Huei Shiau, O. L. Mangasarian 

Publication date: 1987

Published in: SIAM Journal on Control and Optimization (Search for Journal in Brave)

Full work available at URL: http://digital.library.wisc.edu/1793/58636

Recommendations

• scientific article; zbMATH DE number 1187068
• Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
• On the Continuity of the Solution Map in Linear Complementarity Problems
• Lipschitz properties of solutions in mathematical programming
• On continuity properties of the solution map in linear complementarity problems.

zbMATH Keywords

linear inequalitiesperturbation analysisLipschitz continuitylinear complementarity

Mathematics Subject Classification ID

Linear programming (90C05) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cited In (86)

• Second-order sufficient optimality conditions for an optimal control problem with mixed constraints
• Regularizations for stochastic linear variational inequalities
• Error bounds for monotone linear complementarity problems
• An improved multi-parametric programming algorithm for flux balance analysis of metabolic networks
• On the no-gap second-order optimality conditions for a discrete optimal control problem with mixed constraints
• Error bounds for mixed integer linear optimization problems
• Error estimates and Lipschitz constants for best approximation in continuous function spaces
• Nonlinear complementarity as unconstrained and constrained minimization
• On a global error bound for a class of monotone affine variational inequality problems
• Stochastic Variational Inequality Approaches to the Stochastic Generalized Nash Equilibrium with Shared Constraints
• Parallel gradient projection successive overrelaxation for symmetric linear complementarity problems and linear programs
• On the convergence of the exponential multiplier method for convex programming
• Lipschitz continuity of the solution mapping of symmetric cone complementarity problems
• The positiveness of lower limits of the Hoffman constant in parametric polyhedral programs
• Efficient polyhedral enclosures for the reachable set of nonlinear control systems
• Lipschitz properties of solutions in mathematical programming
• A new simple homotopy algorithm for linear programming. I
• Some proximity and sensitivity results in quadratic integer programming
• Descent methods for convex essentially smooth minimization
• Second-order necessary optimality conditions for a discrete optimal control problem with mixed constraints
• Lower semicontinuity of the solution map to a parametric vector variational inequality
• The distance to a polyhedron
• The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program
• Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results
• On the solution stability of variational inequalities
• Some perturbation theory for linear programming
• Error bounds for analytic systems and their applications
• Error bounds in mathematical programming
• Hölder continuity of solutions to a parametric variational inequality
• Second-order necessary optimality conditions for a discrete optimal control problem
• Bounds on the objective value of feasible roundings
• Lipschitz Continuity of Solutions of Variational Inequalities with a Parametric Polyhedral Constraint
• On the convergence of the coordinate descent method for convex differentiable minimization
• Lower semicontinuity of the solution map to a parametric generalized variational inequality in reflexive Banach spaces
• Error bounds for mixed integer nonlinear optimization problems
• Error bounds for the linear complementarity problem with a P-matrix
• Sensitivity and stability analysis for nonlinear programming
• On the linear convergence of the alternating direction method of multipliers
• Continuity of the solution map in quadratic programs under linear perturbations
• Best Lipschitz constants of solutions of quadratic programs
• Continuity of the solution map in parametric affine variational inequalities
• The bilevel programming problem: reformulations, constraint qualifications and optimality conditions
• Upper Lipschitz behavior of solutions to perturbed \(C^{1,1}\) programs
• A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings
• Computation of generalized differentials in nonlinear complementarity problems
• On the Lipschitzian property in linear complementarity problems over symmetric cones
• Two characterization theorems in complementarity theory
• Newton iterations in implicit time-stepping scheme for differential linear complementarity systems
• Lipschitz lower semicontinuity moduli for linear inequality systems
• The Lipschitz properties of the value function and the solution map to a parametric discrete optimal control problem
• On differential stability in stochastic programming
• New uniform parametric error bounds
• Saddle point approximation approaches for two-stage robust optimization problems
• Quantitative stability of full random two-stage stochastic programs with recourse
• Hölder behavior of optimal solutions and directional differentiability of marginal functions in nonlinear programming
• On the convergence of the affine-scaling algorithm
• Solution Continuity in Monotone Affine Variational Inequalities
• The Mordukhovich coderivative and the local metric regularity of the solution map to a parametric discrete optimal control problem
• Sharp Lipschitz Constants for Basic Optimal Solutions and Basic Feasible Solutions of Linear Programs
• A note on optimality conditions for bilevel programming problems^∗
• Error bounds for nondegenerate monotone linear complementarity problems
• On the stability of sets defined by a finite number of equalities and inequalities
• Constructive characterization of Lipschitzian \(Q_ 0\)-matrices
• Error bounds for solutions of linear equations and inequalities
• Lipschitzian \(\mathbb{Q}\)-matrices are \(\mathbb{P}\)-matrices
• The restricted strong convexity revisited: analysis of equivalence to error bound and quadratic growth
• A note of Lipschitz constants for solutions of linear inequalities and equations
• Comments on: Stability in linear optimization and related topics. A personal tour
• Continuity and stability of two-stage stochastic programs with quadratic continuous recourse
• Data-driven quadratic stabilization and LQR control of LTI systems
• New characterizations of Hoffman constants for systems of linear constraints
• Second-order KKT optimality conditions for multiobjective discrete optimal control problems
• On the existence of a Lipschitz feedback control in a control problem with state constraints
• The gap function: evaluating integer programming models over multiple right-hand sides
• Resource allocation for contingency planning: an inexact proximal bundle method for stochastic optimization
• An easily computable upper bound on the Hoffman constant for homogeneous inequality systems
• Error bounds for inconsistent linear inequalities and programs
• Second-order necessary optimality conditions for an optimal control problem
• Generalized differentiation of a class of normal cone operators and sensitivity of optimal control problems
• Title not available (Why is that?)
• Continuity of parametric mixed-integer quadratic programs and its application to stability analysis of two-stage quadratic stochastic programs with mixed-integer recourse
• Second-order necessary optimality conditions for an optimal control problem with nonlinear state equations
• T. Parthasarathy's contributions to complementarity problems: a survey
• Online allocation and pricing: constant regret via Bellman inequalities
• Relaxed multibang regularization for the combinatorial integral approximation
• Generating feasible points for mixed-integer convex optimization problems by inner parallel cuts

This page was built for publication: Lipschitz Continuity of Solutions of Linear Inequalities, Programs and Complementarity Problems

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