scientific article; zbMATH DE number 3247810

From MaRDI portal

zbMath0154.20009MaRDI QIDQ5534710

J. M. Danskin

Publication date: 1967


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Constrained Consensus-Based Optimization, Unnamed Item, Second order sensitivity analysis and asymptotic theory of parametrized nonlinear programs, Stochastic Optimization for Dynamic Pricing, On a generalization of theFarkas theorem, Unnamed Item, On conjugate functions, subgradients, and directional derivatives of a class of optimality criteria in experimental design, Optimality conditions for a class of nondifferentiable minmax programming problems, On a theorem of Danskin with an application to a theorem of Von Neumann-Sion, Sensitivity analysis of nondifferentiable sums of singular values of rectangular matrices, Optimal designs for comparing curves in regression models with asymmetric errors, A stochastic game framework for patrolling a border, Uniform inference for value functions, Consensus formation in first-order graphon models with time-varying topologies, A Decomposition Algorithm for Two-Stage Stochastic Programs with Nonconvex Recourse Functions, Sensitivity Analysis in Applications with Deviation, Risk, Regret, and Error Measures, Bayesian and maximin optimal designs for heteroscedastic multi-factor regression models, Methode directe de recherche du point de selle d'une fonctlonnelle convexe-concave et application aux problémes variationnels elliptiques avec deux controles antagonistes, Optimality Conditions For Max-Type Nonsmooth Minimization Problems, Smooth dynamics and computation in models of economic growth, Smooth dynamics and computation in models of economic growth, Valadier-like formulas for the supremum function I, Regularity properties of the optimal value function in non linear programming, Risk-Averse PDE-Constrained Optimization Using the Conditional Value-At-Risk, A linear max—min problem, Minmaxmin problems revisited, A Generalization of the Multi-Stage Search Allocation Game, Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach, Semi-infinite programming, duality, discretization and optimality conditions†, Minimizing Piecewise-Concave Functions Over Polyhedra, Polyextremal principles and separably-infinite programs, Generalized Gradients and Applications, Sparse Control of Hegselmann--Krause Models: Black Hole and Declustering, Mean value theorems in nonsmooth analysis, Smoothing SQP Methods for Solving Degenerate Nonsmooth Constrained Optimization Problems with Applications to Bilevel Programs, A method of centers algorithm for certain minimax problems, Unnamed Item, Optimality and duality for nonsmooth minimax programming problems using convexifactor, Necessary and sufficient optimality conditions for a class of nonsmooth minimization problems, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, Fixed-order robust compensators via min-max principle, Optimal control of plant disease epidemics with clean seed usage, Analysis of critical damage in the communication network. IV: Multicriteria estimations of cluster vulnerability, Primal explicit max margin feature selection for nonlinear support vector machines, Differentiability of the value function without interiority assumptions, The cone condition and nonsmoothness in linear generalized Nash games, Sequential Stackelberg equilibria in two-person games, New differential properties of sup-type functions, A globally convergent Newton method for convex \(SC^ 1\) minimization problems, Finite method for a nonlinear allocation problem, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Control to Flocking of the Kinetic Cucker--Smale Model, Optimality conditions and duality for a class of continuous-time generalized fractional programming problems, A 2-person game on a polyhedral set of connected strategies, Shape sensitivity of eigenvalue functionals for scalar problems: computing the semi-derivative of a minimum, Sensitivity analysis for expected utility maximization in incomplete Brownian market models, Perturbation theory of nonlinear programs when the set of optimal solutions is not a singleton, Estimates of generalized hessians for optimal value functions in mathematical programming, On the equivalence of D and G-optimal designs in heteroscedastic models, Max-min resource allocation, Duality for minmax \(B\)-vex programming involving \(n\)-set functions, Barriers and potentially safe sets in hybrid systems: pendulum with non-rigid cable, On a PDE arising in one-dimensional stochastic control problems, Directional derivative of a minimax function, Optimal design for prediction in multiresponse linear models based on rectangular confidence region, Pseudo-duality and saddle points, Approximation and contamination bounds for probabilistic programs, A simple derivation of necessary conditions for static minmax problems, Minimax programming under generalized \((p, r)\)-invexity, Set-valued minimax programming problems under generalized cone convexity, Relaxed constant positive linear dependence constraint qualification and its application to bilevel programs, On the convergence of conditional \(\varepsilon\)-subgradient methods for convex programs and convex-concave saddle-point problems., Some applications of Hamilton-Jacobi inequalities for classical and impulsive optimal control problems, Using the parametric approach to solve the continuous-time linear fractional Max-min problems, An algorithm for convex constrained minimax optimization based on duality, Models of the optimal resource allocation for the critical infrastructure protection, Hamilton-Jacobi inequalities and the optimality conditions in the problems of control with common end constraints, Tangency and differentiation: Marginal functions, Generalized semi-infinite programming: a tutorial, On solving simple bilevel programs with a nonconvex lower level program, On Blaschke products associated with \(n\)-widths, Asymptotic analysis of stochastic programs, Solving semi-infinite programs by smoothing projected gradient method, Smoothing by mollifiers. I: Semi-infinite optimization, A survey on the continuous nonlinear resource allocation problem, Optimal observation of the one-dimensional wave equation, Screening and hiding versus search, Optimization models of anti-terrorist protection, A parallel quadratic programming method for dynamic optimization problems, Analysis of critical damage in the communication network. III: Analysis of internode flows, \(E\)-differentiable minimax programming under \(E\)-convexity, On the (non-)differentiability of the optimal value function when the optimal solution is unique, Nonsmooth Optimization, An illumination problem: optimal apex and optimal orientation for a cone of light, Theoretical framework for the analysis of linearly constrained convex programs, On constraint qualifications in nonsmooth optimization., Verallgemeinerte Differenzierbarkeitsbegriffe und ihre Anwendung in der Optimierungstheorie, Infinitely constrained optimization problems, Parametric optimal design, Optimum design in the presence of parametric uncertainty, On characterizingL 1-supports, natural and Chebyshev approximates, Nonsmooth minimax programming under locally Lipschitz \((\Phi , \rho )\)-invexity, Testing the structure of multistage stochastic programs, Duality for minmax programming involving nonsmooth v-invex functions, Minimization methods with constraints, Decomposition of large-scale stochastic optimal control problems, Necessary conditions and sufficient conditions for static minmax problems, Affine minimax variational inequalities and matrix two-person games, Allocation of resources according to a fractional objective, Subdifferential set of the supremum of lower semi-continuous convex functions and the conical hull intersection property, Simple bilevel programming and extensions, A smoothing augmented Lagrangian method for solving simple bilevel programs, Dynamic programming and inequalities, Differential games: their scope, nature, and future, Projection onto a Polyhedron that Exploits Sparsity, Worst-case estimation for econometric models with unobservable components, Quantitative Stability Analysis for Distributionally Robust Optimization with Moment Constraints, On the maximization of a certain nondifferentiable function, Towards Supremum-Sum Subdifferential Calculus Free of Qualification Conditions, Conjugate convex functions, duality, and optimal control problems. I: Systems governed by ordinary differential equations, An approximate Newton method for solving non-smooth equations with infinite max functions, On concepts of directional differentiability, On the solution of some max-min problems, Optimality and duality for minmax problems involving arcwise connected and generalized arcwise connected functions, A SEARCHER VERSUS HIDER GAME WITH INCOMPLETE INFORMATION ABOUT SEARCH RESOURCES, Minimax programming under \((p,r)\)-invexity, A method of feasible directions using function approximations, with applications to min max problems, An algorithm for minimax parameter optimization, Bounds for the first eigenvalue of Fredholm and elliptic operators, Two-sided space-time \(L^1\) polynomial approximation of hypographs within polynomial optimal control, A fast algorithm for solving a simple search problem, Ein operationelles Suchspiel, Extremal problems on the set of nonnegative definite matrices, Nonsmooth analysis on smooth manifolds, Min-max vs. max-min flow control algorithms for optimal computer network capacity assignment, Structural properties of minimax controllers for a class of differential games arising in nonlinear \(H^ \infty\) control, Testing of monotonicity in parametric regression models, Local-global properties of bifunctions, Bilateral exchange and competitive equilibrium, Continuous-time fractional minmax programming