Point-to-Set Maps in Mathematical Programming

From MaRDI portal
Publication:5671791


DOI10.1137/1015073zbMath0256.90042MaRDI QIDQ5671791

William W. Hogan

Publication date: 1973

Published in: SIAM Review (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/1015073


90C25: Convex programming

90C30: Nonlinear programming

90C55: Methods of successive quadratic programming type

46A99: Topological linear spaces and related structures


Related Items

Closure and upper semicontinuity results in mathematical programming, Nash and economic equilibria1, Applications of a general convergence theory for outer approximation algorithms, Convex Parametric Programming in Abstract Spaces, Optimal value functions in parametric programming, On the lower semicontinuity of the feasible region of nonlinear mixed-integer parametric programming, Brève communication. Décomposition en programmation convexe, Inner approximation method for a reverse convex programming problem, Optimality conditions for maximizations of set-valued functions, A note on functions whose local minima are global, Optimality conditions for maximizations of set-valued functions, Generalized quasi-variational inequalities for fuzzy mappings, An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set, Stable parametric programming*, semi-continuities of marginal functions in a sequential setting, Merit functions and descent algorithms for a class of variational ineqality problems, An equilibrium theorem for subdifferential, A new approach for the solution of singular optimum in structural topology optimization, On level sets of marginal functions, Unnamed Item, On the lower semicontinuity of optimal solution sets, Parametrized multicriteria optimization: Continuity and closedness of optimal multifunctions, The lower semicontinuity of optimal solution sets, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, On constraint qualifications in nonsmooth optimization., Continuous perturbations of infinite optimization problems, On the optimal value function for certain linear programs with unbounded optimal solution sets, On approximate minima of a convex functional and lower semicontinuity of metric projections, On generalized semi-infinite programming. (With comments and rejoinder)., Conic set-valued maps in vector optimization, Some properties of the bilevel programming problem, Generalized semi-infinite programming: a tutorial, Smoothing by mollifiers. I: Semi-infinite optimization, On gap functions for quasi-variational inequalities, On the set of weakly efficient minimizers for convex multiobjective programming, Stability of the feasible set mapping of linear systems with an exact constraint set, Smooth sample average approximation of stationary points in nonsmooth stochastic optimization and applications, Stratified Hamiltonians and the optimal feedback control, Stability in vector maximization - a survey, Existence and Lagrangian duality for maximization of set-valued functions, Extensions of Radstrom's lemma with application to stability theory of mathematical programming, Some topological properties of the solution sets of parametrized minimax problems, On the structure and properties of a linear multilevel programming problem, Combinatorial behavior of extreme points of perturbed polyhedra, A characterization of lower semicontinuity of constraint sets, Characterizing optimality in mathematical programming models, Convex two-level optimization, Continuity of the feasible solution sets of probabilistic constrained programs, Characterization of subgradients. I, Asymptotic linearization of uncertain systems by variable structure control, Marginal values in mixed integer linear programming, Derivative evaluation and computational experience with large bilevel mathematical programs, Unification and extensions of some stability theorems in mathematical programming, Stability in multicriteria optimization, Inverse theorem in dynamic programming. I, Inverse theorem in dynamic programming. II, Nachweis von Stabilität bei Optimierungsaufgaben mit Hilfe von Dualitätsbeziehungen, A new solution to optimization-satisfaction problems by a penalty method, On upper semicontinuity of global minima in constrained optimization problems, The generalized quasi-variational inequality problem with applications, Double penalty method for bilevel optimization problems, On functions whose stationary points are global minima, Optimal control existence results for general discrete systems, Stability of nondominated solutions in multicriteria decision-making, Parametrized multicriteria optimization; order continuity of the marginal multifunctions, On the quasiconcave bilevel programming problem, Generalized semi-infinite optimization: A first order optimality condition and examples, Perturbation analysis of a condition number for convex inequality systems and global error bounds for analytic systems, Some notions of nonstationary multistep iteration processes, A class of gap functions for variational inequalities, Image of a parametric optimization problem and continuity of the perturbation function, Existence and continuity of solutions for vector optimization, Convex programs with an additional constraint on the product of several convex functions, Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems, Perturbing the dual feasible region for solving convex quadratic programs, Existence of solutions for generalized quasi-variational-like inequalities, Upper-semi-continuity and cone-concavity of multi-valued vector functions in a duality theory for vector optimization, Possibility and necessity measure specification using modifiers for decision making under fuzziness., A note on stability for parametric equilibrium problems., Continuous dependence of solutions on a parameter in a scalarization method, A refinement of an optimality criterion and its application to parametric programming, On functions whose local minima are global, Stability of majorly efficient points and solutions in multiobjective programming, Additively separable duality theory, Equilibrium existence results for simple dynamic games, Continuous selection and unique polyhedral representation of solutions to convex parametric quadratic programs, Piecewise affinity of min-max MPC with bounded additive uncertainties and a quadratic criterion, Dynamic programming for constrained optimal control of discrete-time linear hybrid systems, Sensitivity and stability analysis for nonlinear programming, Stability and sensitivity analysis in multiobjective nonlinear programming, Computing subdifferentials of marginal functions, Properties of differentiable multivalued mappings, Approximations for chance-constrained programming problems, Sensitivity for parametric vector equilibria, New approach to stochastic optimizing control of steady-state systems using dynamic information, Some new existence, sensitivity and stability results for the nonlinear complementarity problem, Paramétrisation et approximation d'un problème non convexe ; application à un problème de gestion de portefeuille, Directional derivates in minimax problems(∗), On the continuity of the minima for a family of constrained optimization problems, Unnamed Item, Convergence and optimality of modified two-step algorithm for integrated system optimization and parameter estimation, Local epi-continuity and local optimization, Survey of input optimization1, Directional derivatives for the value-function in semi-infinite programming, Stability of efficient sets: continuity of mobile polarities, Stability of efficiency evaluations in data envelopment analysis, The marginal value formula on regions of stability, Unnamed Item, The marginal value formula in input optimization, Computation of subdifferentials of marginal functions using the distance function, On stability of approximate solutions of minimization problems, Conditions de convergence pour les algorithmes itératifs monotones, autonomes et non déterministes, Triple iterative loop technique for optimizing control of large-scale steady-state systems