Publication:2782609
From MaRDI portal
zbMath0991.90002MaRDI QIDQ2782609
Publication date: 7 April 2002
90C25: Convex programming
90C30: Nonlinear programming
52A41: Convex functions and convex programs in convex geometry
90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming
Related Items
Direct Optimal Control and Model Predictive Control, Optimality Conditions for Nonconvex Constrained Optimization Problems, Control Sequencing in a Game of Identity Pursuit-Evasion, Distributed partitioning algorithms for multi-agent networks with quadratic proximity metrics and sensing constraints, Motzkin's theorem of the alternative: a continuous-time generalization, Computer geometry and encoding the information on a manifold, Optimal control problem regularization for the Markov process with finite number of states and constraints, Team optimization problems with Lipschitz continuous strategies, Lossless convexification of a class of optimal control problems with non-convex control constraints, On convex optimization without convex representation, A mixed finite element method for thin film epitaxy, Towards the optimal control of Markov chains with constraints, Towards global bilevel dynamic optimization, On representations of the feasible set in convex optimization, Extensions of convex and semiconvex functions and intervally thin sets, Existence and uniqueness of constrained globally optimal feedback controls in a linear-quadratic framework, A two-resource allocation algorithm with an application to large-scale zero-sum defensive games, Autonomous trajectory planning for space vehicles with a Newton-Kantorovich/convex programming approach, An extension of the coordinate transformation method for open-loop Nash equilibria, Additive outliers in INAR(1) models, A fragile multi-CPR game, Theory of functional connections applied to quadratic and nonlinear programming under equality constraints, Pursuit differential game of many pursuers with integral constraints on compact convex set, Preserving convexity through rational cubic spline fractal interpolation function, A continuation approach for solving binary quadratic program based on a class of NCP-functions, Allocating multiple defensive resources in a zero-sum game setting, Necessary and sufficient KKT optimality conditions in non-convex optimization, Differentiability v.s. convexity for complementarity functions, Bayesian generalization with circular consequential regions, Generalized separation theorems and the Farkas' lemma, Complete analysis to minimum-error discrimination of four mixed qubit states with arbitrary prior probabilities, Weighted Optimization with Thresholding for Complete-Case Analysis
