scientific article; zbMATH DE number 3672000
From MaRDI portal
Publication:3869074
zbMATH Open0431.90039MaRDI QIDQ3869074FDOQ3869074
Authors: B. D. Craven 
Publication date: 1978
Title of this publication is not available (Why is that?)
algorithmsmathematical programmingconstrained optimizationunconstrained optimizationcontrol theoryPontryagin's maximum principlefractional programmingnecessary optimality conditionsoptimal control problemconvex analysis in abstract vector spacesKuhn-Tucker-theory
Convex programming (90C25) Fractional programming (90C32) Applications of mathematical programming (90C90) Nonlinear programming (90C30) 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 operations research and mathematical programming (90-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-01)
Cited In (only showing first 100 items - show all)
- Nonsmooth multiobjective programming
- Nonlinear alternative theorems and nondifferentiable programming
- Generalized fractional programming duality: A parametric approach
- The finite criss-cross method for hyperbolic programming
- Characterizations of optimal solution sets of convex infinite programs
- Programming with semilocally convex functions
- On generalized convexity and duality with a square root term
- Asymptotic kuhn-tucker conditions in abstract spaces
- Farkas-type results for vector-valued functions with applications
- Fractional programming
- Generalized implicit function theorems when the derivative has no bounded inverse
- Duality for generalized fractional programs involving n-set functions
- Subdifferentials of value functions and optimality conditions for DC and bilevel infinite and semi-infinite programs
- Stability analysis for point delay fractional description models via linear matrix inequalities
- Results of farkas type
- Fractional programming
- An efficient trust region method for unconstrained discrete-time optimal control problems
- A complete algorithm for linear fractional programs
- A generalized Farkas lemma with applications to quasidifferentiable programming
- On duality for weakly minimized vector valued optimization problems
- On sensitivity analysis for multicriteria optimization
- A class of nondifferentiable continuous programming problems
- Some relations between variational-like inequality problems and vectorial optimization problems in Banach spaces
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Complete characterization of optimality for convex programming in banach spaces†
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- The principle and models of dynamic programming. II
- FJ-invex control problem
- Generalized second-order characterizations of convex functions
- Eigenvalues, eigenspaces and distances to subsets
- Inequality systems and optimization
- Modified Kuhn-Tucker conditions when a minimum is not attained
- A class of nondifferentiable control problems
- Generalizations of Slater's constraint qualification for infinite convex programs
- Solvability theorems for classes of difference convex functions
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Duality and infinite dimensional optimization
- Bibliography in fractional programming
- Symmetric dual fractional programming
- On optimality in abstract convex programming
- Optimality conditions for bilevel programming: an approach through variational analysis
- Weak minimization and duality
- Complex minimax programming under generalized type-I functions
- On \(F\)-convex functions
- Second-order conditions in c1, 1optimization with applications
- Necessary and Sufficient Optimality Conditions for Non-regular Problems
- Duality in generalized fractional programming via Farkas' lemma
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- New Farkas-type constraint qualifications in convex infinite programming
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Dynamic programming and inequalities
- Dynamic programming and penalty functions
- Non-convex infinite games
- Robust stability analysis and dynamic gain-scheduled controller design for point time-delay systems with parametrical uncertainties
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Nondifferentiable optimization by smooth approximations
- On optimality conditions in nonsmooth inequality constrained minimization
- Numerical methods of nonlinear optimal control based on mathematical programming
- Regularity Conditions and Optimality in Vector Optimization
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- Complex minimax programming under generalized convexity
- Nonconvex theorems of the alternative and minimization
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- \(S\)-adapted equilibria in games played over event trees with coupled constraints
- First and second-order optimality conditions for convex composite multiobjective optimization
- A vector variational inequality and optimization over an efficient set
- Convex composite multi-objective nonsmooth programming
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- A Fritz John optimality condition using the approximate subdifferential
- The Lagrange approach to infinite linear programs
- Sufficiency and mixed type duality for multiobjective variational control problems involving \(\alpha\)-V-univexity
- Solvability results for sublinear functions and operators
- A general Farkas lemma
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Existence results and gap functions for the generalized equilibrium problem with composed functions
- Proper efficiency in vector infinite programming problems
- Existence of solutions of bilevel strong vector equilibrium problems and their applications
- Linear programming with matrix variables
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- A transposition theorem with applications to constrained optimal control problems
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- On variational problems involving higher order derivatives
- Generalized concavity and duality with a square root term
- Convexlike alternative theorems and mathematical programming
- On rigidity and realizability of weighted graphs
- Multiobjective fractional programming duality. a Lagrangian approach
- Invexity in multifunction optimization
- A duality theorem in Hilbert space
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Nonlinear Lagrangian theory for nonconvex optimization.
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- Use of reference points for solving MONLP problems
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
- Optimal control and invexity
- Two-parameter ridge regression and its convergence to the eventual pairwise model
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3869074)
