Publication:3869074
From MaRDI portal
zbMath0431.90039MaRDI QIDQ3869074
Publication date: 1978
algorithmsunconstrained optimizationnecessary optimality conditionsconstrained optimizationfractional programmingoptimal control problemcontrol theoryPontryagin's maximum principlemathematical programmingconvex analysis in abstract vector spacesKuhn-Tucker-theory
Convex programming (90C25) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Fractional programming (90C32) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Optimality conditions for problems involving ordinary differential equations (49K15) Optimality conditions for problems in abstract spaces (49K27) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Related Items
Complex minimax programming under generalized convexity, Farkas-type results for vector-valued functions with applications, On optimality in abstract convex programming, A Fritz John optimality condition using the approximate subdifferential, Convexlike alternative theorems and mathematical programming, Generalized second-order characterizations of convex functions, Global efficiency in multiobjective programming*, A class of nondifferentiable control problems, Proper efficiency in vector infinite programming problems, Multiobjective fractional programming duality. a Lagrangian approach, Nondifferentiable optimization by smooth approximations, Generalized fractional programming duality: A parametric approach, The Lagrange approach to infinite linear programs, FJ-invex control problem, Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs, Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems, Eigenvalues, eigenspaces and distances to subsets, Results of farkas type, A vector variational inequality and optimization over an efficient set, Solvability results for sublinear functions and operators, A modified wolfe dual for weak vector minimization, A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential, Second-order conditions in c1, 1optimization with applications, First and second-order optimality conditions for convex composite multiobjective optimization, Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem, On duality for weakly minimized vector valued optimization problems, A duality theorem in Hilbert space, On optimality conditions in nonsmooth inequality constrained minimization, Asymptotic dual conditions characterizing optimality for infinite convex programs, Solvability theorems for classes of difference convex functions, Some efficient algorithms for unconstrained discrete-time optimal control problems, Characterizing global optimality for DC optimization problems under convex inequality constraints, Optimal control and invexity, Use of reference points for solving MONLP problems, A short elementary proof of the Lagrange multiplier theorem, Nonlinear alternative theorems and nondifferentiable programming, On generalized convexity and duality with a square root term, Some relations between variational-like inequality problems and vectorial optimization problems in Banach spaces, Stability analysis for point delay fractional description models via linear matrix inequalities, On Quasidifferentiable Functions and Non-Differentiable Programming, Linear multicriteria sensitivity and shadow costs, A note on convex cones and constraint qualifications in infinite- dimensional vector spaces, Linear programming with matrix variables, The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions, Nonsmooth multiobjective programming, Weak minimization and duality, Constraint qualifications characterizing Lagrangian duality in convex optimization, Farkas' lemma: three decades of generalizations for mathematical optimization, On sensitivity analysis for multicriteria optimization, Duality in generalized fractional programming via Farkas' lemma, Avoiding a Constraint Qualification, Non-convex infinite games, \(S\)-adapted equilibria in games played over event trees with coupled constraints, Sufficiency and mixed type duality for multiobjective variational control problems involving \(\alpha\)-V-univexity, Numerical methods of nonlinear optimal control based on mathematical programming, Ekeland Duality as a Paradigm, Generalizations of Slater's constraint qualification for infinite convex programs, Convex composite multi-objective nonsmooth programming, Two-parameter ridge regression and its convergence to the eventual pairwise model, Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program, Programming with semilocally convex functions, On variational problems involving higher order derivatives, Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming, Robust stability analysis and dynamic gain-scheduled controller design for point time-delay systems with parametrical uncertainties, Duality for generalized fractional programs involving n-set functions, Optimality conditions for strong vector equilibrium problems under a weak constraint qualification, An efficient trust region method for unconstrained discrete-time optimal control problems, Complete characterization of optimality for convex programming in banach spaces†, On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality, Existence of solutions of bilevel strong vector equilibrium problems and their applications, The finite criss-cross method for hyperbolic programming, A complete algorithm for linear fractional programs, Dynamic programming and inequalities, Dynamic programming and penalty functions, The principle and models of dynamic programming. II, Characterizations of optimal solution sets of convex infinite programs, A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes, Pontryagin principle with a PDE: a unified approach, Theorems of the alternative and optimality conditions for convexlike and general convexlike programming, Existence results and gap functions for the generalized equilibrium problem with composed functions, Modified Kuhn-Tucker conditions when a minimum is not attained, Images of cones under linear mappings, A general Farkas lemma, A generalization of a minimax theorem of Fan via a theorem of the alternative, Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems, Sufficient optimality criteria and duality for multiobjective variational control problems with \(G\)-type I objective and constraint functions, Generalized implicit function theorems when the derivative has no bounded inverse, Symmetric dual fractional programming, Implicit function theorems and lagrange multipliers, A Farkas lemma for difference sublinear systems and quasidifferentiable programming, Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*, Inequality systems and optimization, Variational inequalities with cone constraints, Complex minimax programming under generalized type-I functions, Bibliography in fractional programming, Asymptotic kuhn-tucker conditions in abstract spaces, A generalized Farkas lemma with applications to quasidifferentiable programming, A class of nondifferentiable continuous programming problems, Minimax principles for convex eigenvalue problems, Generalized concavity and duality with a square root term, Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case, Optimality Conditions for Bilevel Programming: An Approach Through Variational Analysis, Necessary and Sufficient Optimality Conditions for Non-regular Problems, Unnamed Item, Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency, Fractional programming, Fractional programming, On rigidity and realizability of weighted graphs, New Farkas-type constraint qualifications in convex infinite programming, Nonlinear Lagrangian theory for nonconvex optimization., Regularity Conditions and Optimality in Vector Optimization, Duality and infinite dimensional optimization, Invexity in multifunction optimization, Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization, Nonconvex theorems of the alternative and minimization, A transposition theorem with applications to constrained optimal control problems, On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems, Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity
