Some continuity properties of polyhedral multifunctions
From MaRDI portal
Publication:3896861
DOI10.1007/BFb0120929zbMath0449.90090OpenAlexW1583089965MaRDI QIDQ3896861
Publication date: 1981
Published in: Mathematical Programming Studies (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bfb0120929
linear complementarityparametric programmingpolyhedral convex setscontinuity propertiespolyhedral multifunctions
Sensitivity, stability, parametric optimization (90C31) Set-valued maps in general topology (54C60) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
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, On M-stationary conditions and duality for multiobjective mathematical programs with vanishing constraints, From Calmness to Hoffman Constants for Linear Semi-infinite Inequality Systems, Projection-based local and global Lipschitz moduli of the optimal value in linear programming, First-Order Optimality Conditions for Mathematical Programs with Second-Order Cone Complementarity Constraints, An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications, Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market, Scaled relative graphs: nonexpansive operators via 2D Euclidean geometry, Sensitivity and stability analysis for nonlinear programming, Uniformity and inexact version of a proximal method for metrically regular mappings, Optimal Control Problems with Terminal Complementarity Constraints, Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints, Continuity of the solution map in parametric affine variational inequalities, Inclusions in general spaces: Hoelder stability, solution schemes and Ekeland's principle, A relaxed projection method for variational inequalities, Unnamed Item, Calmness as a Constraint Qualification for M-Stationarity Conditions in MPECs, Augmented Lagrangian methods for convex matrix optimization problems, Estimates of generalized hessians for optimal value functions in mathematical programming, Dynamic vaccination games and variational inequalities on time-dependent sets, An investigation on semismooth Newton based augmented Lagrangian method for image restoration, On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function, Variational Analysis of Composite Models with Applications to Continuous Optimization, Metric regularity and Lipschitzian stability of parametric variational systems, Unnamed Item, Unnamed Item, Error bounds for solutions of linear equations and inequalities, Strong metric subregularity of mappings in variational analysis and optimization, Calmness of the Optimal Value in Linear Programming, 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, An approach to calmness of linear inequality systems from Farkas lemma, Enhanced Fritz John stationarity, new constraint qualifications and local error bound for mathematical programs with vanishing constraints, A block symmetric Gauss-Seidel decomposition theorem for convex composite quadratic programming and its applications, Unified linear convergence of first-order primal-dual algorithms for saddle point problems, Quadratic Growth Conditions for Convex Matrix Optimization Problems Associated with Spectral Functions, Subdifferentials and stability analysis of feasible set and Pareto front mappings in linear multiobjective optimization, Convergence Rate Analysis for Averaged Fixed Point Iterations in Common Fixed Point Problems, Unnamed Item, The radius of metric subregularity, Error bounds and a condition number for the absolute value equations, Superlinear convergence of the sequential quadratic method in constrained optimization, Solving saddle point problems: a landscape of primal-dual algorithm with larger stepsizes, Calmness of partial perturbation to composite rank constraint systems and its applications, A Highly Efficient Semismooth Newton Augmented Lagrangian Method for Solving Lasso Problems, Convergence of iterates in nonlinear Perron-Frobenius theory, On estimating the regular normal cone to constraint systems and stationarity conditions, Some new existence, sensitivity and stability results for the nonlinear complementarity problem, Optimization and discrete approximation of sweeping processes with controlled moving sets and perturbations, Variational conditions and the proto-differentiation of partial subgradient mappings, Two-level value function approach to non-smooth optimistic and pessimistic bilevel programs, Calmness of partially perturbed linear systems with an application to the central path, Convergence rates for boundedly regular systems, A first-order inexact primal-dual algorithm for a class of convex-concave saddle point problems, New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints, Optimality conditions for the simple convex bilevel programming problem in Banach spaces, On calmness conditions in convex bilevel programming, Complementary problems with polynomial data, Calmness of the argmin mapping in linear semi-infinite optimization, Differential variational inequalities, A solution differentiability result for evolutionary quasi-variational inequalities, Solution continuity in variational conditions, On the convergence of combined relaxation methods for variational inequalties, A new relative error criterion for the proximal point algorithm, Weak sharp efficiency and growth condition for vector-valued functions with applications, Linear Convergence of the Alternating Direction Method of Multipliers for a Class of Convex Optimization Problems, Deregulated electricity markets with thermal losses and production bounds: models and optimality conditions, On the efficient computation of a generalized Jacobian of the projector over the Birkhoff polytope, A linearly convergent majorized ADMM with indefinite proximal terms for convex composite programming and its applications, Continuity of solutions for parametric variational inequalities in Banach space, Isolated calmness of solution mappings in convex semi-infinite optimization, Second-order variational analysis in second-order cone programming, New analysis of linear convergence of gradient-type methods via unifying error bound conditions, Linear Convergence of Descent Methods for the Unconstrained Minimization of Restricted Strongly Convex Functions, Metric subregularity and/or calmness of the normal cone mapping to the \(p\)-order conic constraint system, Necessary Optimality Conditions for Optimal Control Problems with Equilibrium Constraints, On Lipschitzian Properties of Implicit Multifunctions, A new complementarity function and applications in stochastic second-order cone complementarity problems, Lipschitz modulus of the optimal value in linear programming, Variational analysis perspective on linear convergence of some first order methods for nonsmooth convex optimization problems, On Lipschitz behaviour of some generalized derivatives, Computation of graphical derivatives of normal cone maps to a class of conic constraint sets, On M-stationary points for mathematical programs with equilibrium constraints, On the R-superlinear convergence of the KKT residuals generated by the augmented Lagrangian method for convex composite conic programming, A semismooth Newton-based augmented Lagrangian algorithm for density matrix least squares problems, Calmness of constraint systems with applications, Constraint Qualifications and Optimality Conditions in Bilevel Optimization, Sensitivity analysis for constraint and variational systems by means of set-valued differentiation, Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector, On calmness of the argmin mapping in parametric optimization problems, Sufficient Optimality Conditions in Bilevel Programming, 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, Some recent advances in projection-type methods for variational inequalities, Iterative solving of generalized equations with calm solution mappings, On the structure of convex piecewise quadratic functions, Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets, Error bounds for the solution sets of quadratic complementarity problems, Constraint qualifications for nonsmooth mathematical programs with equilibrium constraints, New improved error bounds for the linear complementarity problem, Error bounds for analytic systems and their applications, Linear convergence of the generalized Douglas-Rachford algorithm for feasibility problems, Error bounds for inconsistent linear inequalities and programs, Outer limit of subdifferentials and calmness moduli in linear and nonlinear programming, Lipschitz and Hölder stability of optimization problems and generalized equations, A SAA nonlinear regularization method for a stochastic extended vertical linear complementarity problem, Critical multipliers in variational systems via second-order generalized differentiation, Necessary optimality conditions for optimal control problems with nonsmooth mixed state and control constraints, Error estimates and Lipschitz constants for best approximation in continuous function spaces, Linearly convergent descent methods for the unconstrained minimization of convex quadratic splines, Stability of possibly nonisolated solutions of constrained equations, with applications to complementarity and equilibrium problems, An active set algorithm for nonlinear optimization with polyhedral constraints, Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton, Error bounds in mathematical programming, Positively homogeneous functions revisited, On the convergence of an inexact Newton-type method, Sensitivity analysis for generalized linear-quadratic problems, Proto-differentiability of set-valued mappings and its applications in optimization, Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction, Convergence analysis of perturbed feasible descent methods, A reduction method for variational inequalities, A unified approach to error bounds for structured convex optimization problems, Three modeling paradigms in mathematical programming, On regular coderivatives in parametric equilibria with non-unique multipliers, Recent contributions to linear semi-infinite optimization, Improved generalization via tolerant training, Optimal control of the sweeping process over polyhedral controlled sets, Stability analysis of one stage stochastic mathematical programs with complementarity constraints, On the upper Lipschitz property of the KKT mapping for nonlinear semidefinite optimization, Nonmonotone gradient methods for vector optimization with a portfolio optimization application, Stabilized sequential quadratic programming for optimization and a stabilized Newton-type method for variational problems, On metric pseudo-(sub)regularity of multifunctions and optimality conditions for degenerated mathematical programs, Linear convergence of the randomized sparse Kaczmarz method, New results in the theory of multivalued mappings. I: Topological characteristics and solvability of operator relations, Optimality, identifiability, and sensitivity, First order optimality conditions for mathematical programs with semidefinite cone complementarity constraints, On the Karush-Kuhn-Tucker reformulation of the bilevel optimization problem, The exact penalty principle, On Lipschitz semicontinuity properties of variational systems with application to parametric optimization, Recent contributions to linear semi-infinite optimization: an update, Conditioning of linear-quadratic two-stage stochastic optimization problems, Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions, Convergence of the augmented decomposition algorithm, On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs, Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem, Optimality conditions for nonsmooth multiobjective optimization using Hadamard directional derivatives, On a global projection-type error bound for the linear complementarity problem, Critical objective size and calmness modulus in linear programming, Necessary optimality conditions for implicit control systems with applications to control of differential algebraic equations, Global error bounds for monotone affine variational inequality problems, Sensitivity analysis for nonsmooth generalized equations, Point-based neighborhoods for sharp calmness constants in linear programming, On the Aubin property of a class of parameterized variational systems, On a global error bound for a class of monotone affine variational inequality problems, Metric subregularity in generalized equations, A coordinate gradient descent method for nonsmooth separable minimization, Modified proximal point algorithm for extended linear-quadratic programming, Bilevel road pricing: theoretical analysis and optimality conditions, Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints, Predictor-corrector smoothing methods for monotone LCP, Weakly upper Lipschitz multifunctions and applications in parametric optimization, Necessary and sufficient optimality conditions for mathematical programs with equilibrium constraints, A new algorithm for solving convex parametric quadratic programs based on graphical derivatives of solution mappings, Stability results for polyhedral complementarity problems, Convergence rates for an inexact ADMM applied to separable convex optimization, Exact penalty functions and calmness for mathematical programming under nonlinear perturbations, Kurdyka-Łojasiewicz property of zero-norm composite functions, 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, A dual symmetric Gauss-Seidel alternating direction method of multipliers for hyperspectral sparse unmixing, Affine minimax variational inequalities and matrix two-person games, Stability of Mann's iterates under metric regularity, On the quantitative solution stability of parameterized set-valued inclusions, Convergence of splitting and Newton methods for complementarity problems: An application of some sensitivity results, Calmness of the feasible set mapping for linear inequality systems, An affine scaling method for optimization problems with polyhedral constraints, Correction to: ``Kurdyka-Łojasiewicz property of zero-norm composite functions, Constrained Lipschitzian error bounds and noncritical solutions of constrained equations, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, An efficient Hessian based algorithm for singly linearly and box constrained least squares regression, Scenario tree modeling for multistage stochastic programs, Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem, Convexity and concavity properties of the optimal value function in parametric nonlinear programming, On (local) analysis of multifunctions via subspaces contained in graphs of generalized derivatives, Infeasible-interior-point paths for sufficient linear complementarity problems and their analyticity, A symmetric Gauss-Seidel based method for a class of multi-period mean-variance portfolio selection problems, More results on the convergence of iterative methods for the symmetric linear complementarity problem, Error bounds and convergence analysis of feasible descent methods: A general approach, A trust region algorithm for nonlinear bilevel programming, 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, Optimality conditions for pessimistic semivectorial bilevel programming problems, Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming, Error bounds for the solution sets of generalized polynomial complementarity problems, Solving the OSCAR and SLOPE Models Using a Semismooth Newton-Based Augmented Lagrangian Method, On Hölder calmness of minimizing sets, Geometrical and analytical characteristic properties of piecewise affine mappings, Exact computation of an error bound for the balanced linear complementarity problem with unique solution, An augmented Lagrangian method for optimization problems with structured geometric constraints, Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates, Zero-norm regularized problems: equivalent surrogates, proximal MM method and statistical error bound, Second-Order Optimality Conditions for General Nonconvex Optimization Problems and Variational Analysis of Disjunctive Systems, Nonlocal error bounds for piecewise affine functions, Multiobjective optimization with least constraint violation: optimality conditions and exact penalization, Relationships between polyhedral convex sets and generalized polyhedral convex sets, On convergence rates of proximal alternating direction method of multipliers, A semismooth Newton based dual proximal point algorithm for maximum eigenvalue problem, A dual semismooth Newton based augmented Lagrangian method for large-scale linearly constrained sparse group square-root Lasso problems, Local Error Bounds for Affine Variational Inequalities on Hilbert Spaces, Robust and continuous metric subregularity for linear inequality systems, Controlled polyhedral sweeping processes: existence, stability, and optimality conditions, A Stochastic Composite Augmented Lagrangian Method for Reinforcement Learning, Lipschitz upper semicontinuity in linear optimization via local directional convexity, Local convergence analysis of augmented Lagrangian method for nonlinear semidefinite programming, Continuous Selections of Solutions to Parametric Variational Inequalities, A Proximal Point Dual Newton Algorithm for Solving Group Graphical Lasso Problems, An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming, Unnamed Item, Unnamed Item, Strong calmness of perturbed KKT system for a class of conic programming with degenerate solutions, Convergence revisit on generalized symmetric ADMM, Error bounds for \(R_0\)-type and monotone nonlinear complementarity problems., New Constraint Qualifications for Mathematical Programs with Equilibrium Constraints via Variational Analysis, Stability of the linear complementarity problem at a solution point, A unified numerical scheme for linear-quadratic optimal control problems with joint control and state constraints, A representation of generalized convex polyhedra and applications, Generalized Conjugate Gradient Methods for ℓ1 Regularized Convex Quadratic Programming with Finite Convergence, Linear Rate Convergence of the Alternating Direction Method of Multipliers for Convex Composite Programming, Preconditioned proximal point methods and notions of partial subregularity, A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution, Criticality of Lagrange Multipliers in Variational Systems, Unnamed Item, Efficient Sparse Semismooth Newton Methods for the Clustered Lasso Problem, Directional Quasi-/Pseudo-Normality as Sufficient Conditions for Metric Subregularity, The continuity of the solution map in linear complementarity problems with underlyingk-matrices, Optimization and equilibrium problems with equilibrium constraints in infinite-dimensional spaces, Optimality Conditions and Stability Analysis via the Mordukhovich Subdifferential, On Degenerate Doubly Nonnegative Projection Problems, Second-Order Optimality Conditions for Nonconvex Set-Constrained Optimization Problems
