scientific article

No author found.

Publication date: 1986

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

optimal control parametrization linearization textbook necessary and sufficient conditions discrete optimization convex analysis penalties projected gradients reduced gradients

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Integer programming (90C10) Nonlinear programming (90C30) Numerical optimization and variational techniques (65K10) Linear programming (90C05) Numerical methods based on nonlinear programming (49M37) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Methods of successive quadratic programming type (90C55) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)

Related Items (68)

Optimization of the Hausdorff distance between sets in Euclidean space ⋮ Resolution of a linear-quadratic optimal control problem based on finite-dimensional models ⋮ Unnamed Item ⋮ Multi-level defense system models: overcoming by means of attacks with several phase constraints ⋮ Limit vector variational inequalities and market equilibrium problems ⋮ Generalized target-allocation functions and their evaluation by the branch-and-bound method ⋮ On the existence of continuous selections of a multivalued mapping related to the problem of minimizing a functional ⋮ Use of branch and bound method for search of an equilibrium in potential Cournot model ⋮ Necessary conditions for an extremum in a mathematical programming problem ⋮ Decomposition approaches for constrained spatial auction market problems ⋮ Block-iterative surrogate projection methods for convex feasibility problems ⋮ Minimizing a Symmetric Quasiconvex Function on a Two-Dimensional Lattice ⋮ Optimizing the solution of some problems of protection against groundwater flooding ⋮ Hydraulic network design for stationary operation ⋮ Methods for solution of control problems of multicommodity stock with random demand ⋮ An approach to solution of the movements routing problem with several participants ⋮ Unnamed Item ⋮ A linear separability criterion for sets of Euclidean space ⋮ Sign reversion approach to concave minimization problems ⋮ Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary ⋮ Solving the general quadratic programming problem in a finite number of steps ⋮ Problems and methods for multiproduct inventory control in production conditions ⋮ The problem of projecting the origin of Euclidean space onto the convex polyhedron ⋮ Control model for heterogeneous computational tasks based on guaranteed estimates of execution times ⋮ Extremum problems in the presence of restrictions in the metric space ⋮ Controlling computationally intensive heterogeneous computational tasks with directive deadlines ⋮ Theorems of the alternative for systems of convex inequalities ⋮ One variant of the objective function parameterization method and its implementation ⋮ On the convexity of reachability sets of controlled initial-boundary value problems ⋮ Necessary and sufficient conditions for a minimum of mixed order ⋮ One approach for solving optimization problems with apriori estimates of approximation of admissible set ⋮ Unnamed Item ⋮ Algorithms of optimal ball packing into ellipsoids ⋮ On \(\varepsilon\)-optimal points of convex, closed functions ⋮ Solution of a game-theoretical model of resource allocation ⋮ Optimality conditions in extremal problems with nonregular inequality constraints ⋮ On resolution of an extremum norm problem for the terminal state of a linear system ⋮ On variational inequalities for auction market problems ⋮ Quantum flag manifolds as quotients of degenerate quantized universal enveloping algebras ⋮ An attack-defense model with inhomogeneous resources of the opponents ⋮ Methods for choosing loaded train and car routes along a railroad network ⋮ Nonsmooth Optimization ⋮ On penalty methods for non monotone equilibrium problems ⋮ Sequential stable Kuhn-Tucker theorem in nonlinear programming ⋮ On the construction of a set of effective vectors ⋮ Application of penalty methods to non-stationary variational inequalities ⋮ Vector equilibrium problems on unbounded sets ⋮ A theorem on strict separability of convex polyhedra and its applications in optimization ⋮ Nonmonotone equilibrium problems: Coercivity conditions and weak regularization ⋮ Minimization of the Hausdorff distance between convex polyhedrons ⋮ Approximating sets on a plane with optimal sets of circles ⋮ Data aggregation for scheduling of resource-intensive computations under uncertainty ⋮ Control of resource-intensive computations under uncertainty. I. multiparametric model ⋮ A discrete multilevel attack-defense model with nonhomogeneous opponent resources ⋮ Barrier function method and correction algorithms for improper convex programming problems ⋮ A nonlinear descent method for a variational inequality on a nonconvex set ⋮ Using feedback functions in linear programming problems ⋮ Parameterization of some control problems by linear systems ⋮ Linearization method for constrained limit extremal problems ⋮ Multi-objective optimization over convex disjunctive feasible sets using reference points ⋮ Generalized linearly homogeneous production functions ⋮ Maximin problem of communication network synthesis ⋮ Necessary and sufficient conditions for emptiness of the cones of generalized support vectors ⋮ The conditions of minimum for a smooth functionon the boundary of a quasidifferntiable set ⋮ Nondifferential Kuhn–Tucker theorems in constrained extremum problems via subdifferentials of nonsmooth analysis ⋮ A notion of dominated strategies in interaction models ⋮ Optimality conditions in control problems for systems described by equations with monotone operators ⋮ Universal procedure for constructing a Pareto set

This page was built for publication: