On the continuity of the minimum set of a continuous function
From MaRDI portal
Publication:2526073
DOI10.1016/0022-247X(67)90139-4zbMath0153.49201OpenAlexW2077136942MaRDI QIDQ2526073
Publication date: 1967
Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-247x(67)90139-4
Related Items
Penalty methods for computing points that satisfy second order necessary conditions, Existence and continuity of solutions for vector optimization, A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints, Input optimization: I. Optimal realizations of mathematical models, Topological existence and stability for Stackelberg problems, Diffusion approximation for an input-queued switch operating under a maximum weight matching policy, Finite method for a nonlinear allocation problem, A characterization of lower semicontinuity of constraint sets, Sensitivity and stability analysis for nonlinear programming, On constrained maxima of convex functions, A model for equilibrium in some service-provider user-set interactions, Limits of eventual families of sets with application to algorithms for the common fixed point problem, Levels sets infimal convolution and level addition, Inf-sup control of discontinuous piecewise affine systems, On stability of approximate solutions of minimization problems, Unnamed Item, Sensitivity analysis for generalized linear-quadratic problems, Unification and extensions of some stability theorems in mathematical programming, Stability of the solution of definite quadratic programs, Calmness of the Optimal Value in Linear Programming, Stability in multicriteria optimization, Unnamed Item, Convergence of a continuous approach for zero-one programming problems, Applying convexificators in robust multiobjective optimization, Multi-path utility maximization and multi-path TCP design, semi-continuities of marginal functions in a sequential setting, Connected level sets, minimizing sets and uniqueness in optimization, Implicit function theorems for mathematical programming and for systems of inequalities, Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms, Nachweis von Stabilität bei Optimierungsaufgaben mit Hilfe von Dualitätsbeziehungen, Smooth representation of a parametric polyhedral convex set with application to sensitivity in optimization, Unnamed Item, A log-exponential smoothing method for mathematical programs with complementarity constraints, On optimality gaps for fuzzification in finite Markov decision processes, A smoothing method for zero--one constrained extremum problems, Time-axis decomposition of large-scale optimal control problems, On upper semicontinuity of global minima in constrained optimization problems, Bilevel problems over polyhedra with extreme point optimal solutions, Necessary optimality conditions for bilevel set optimization problems, Adaptive control of constrained Markov chains: Criteria and policies, Sensitivity of constrained Markov decision processes, Convergence of asymptotic directions, Fuzzy optimality relation for perceptive MDPs-the average case, A Trust Regional Algorithm for Bound Constrained Minimization, Stability results of a class of well-posed optimization problems, Constrained cost-coupled stochastic games with independent state processes, Risky arbitrage, asset prices, and externalities, A trust region algorithm for a class of nonlinear optimization, Unnamed Item, Solving some optimal control problems using the barrier penalty function method, Lower semicontinuity and upper semicontinuity of the solution sets and approximate solution sets of parametric multivalued quasivariational inequalities, The lower semicontinuity of optimal solution sets, Continuous selection and unique polyhedral representation of solutions to convex parametric quadratic programs, Approximations for chance-constrained programming problems, The fundamental continuity theory of optimization on a compact space. I, Stability theorems for infinitely constrained mathematical programs, A sufficient condition for continuity of optimal sets in mathematical programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Sensitivity analysis for nonlinear programming using penalty methods, The continuity of the optimum in parametric programming and applications to stochastic programming, Workload reduction of a generalized Brownian network, Optimal value functions in parametric programming, Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems, Perturbed convex programming in reflexive Banach spaces, Dynamics of cooperative games, Partial augmented Lagrangian method and mathematical programs with complementarity constraints, Further study on augmented Lagrangian duality theory, Mixed integer minimization models for piecewise-linear functions of a single variable, Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions, On the relations between two types of convergence for convex functions, Reliability by design in distributed power transmission networks, Global optimization algorithm for the nonlinear sum of ratios problem, Refinements of necessary optimality conditions in nondifferentiable programming. I, Stability of nondominated solutions in multicriteria decision-making, Lower-order penalty methods for mathematical programs with complementarity constraints, On the quasiconcave bilevel programming problem, Convergence of minima in convergence spaces1, Lipschitz modulus of the optimal value in linear programming, Closure and upper semicontinuity results in mathematical programming, Nash and economic equilibria1, Sufficient conditions for the stability of local minimum points in nonsmooth optimization, Absolutely continuous constrained maximizers, Minima of quasi-convex functions, Convergence properties of local solutions of sequences of mathematical programming problems in general spaces, Characterizing an optimal input in perturbed convex programming, On functions whose local minima are global, Bounds for error in the solution set of a perturbed linear program, Integer and mixed-integer programming models: General properties, Combination between global and local methods for solving an optimization problem over the efficient set, On the optimal value function for certain linear programs with unbounded optimal solution sets, On linear multiparametric optimization with parameter-dependent constraint matrix, Best approximation and optimization, On approximate minima of a convex functional and lower semicontinuity of metric projections, Supporting others and the evolution of influence., The primal-dual algorithm as a constraint-set-manipulation device, On the continuity of the minima for a family of constrained optimization problems∗, Stability in vector maximization - a survey
Cites Work