scientific article; zbMATH DE number 3672000
algorithmsconstrained optimizationcontrol theoryconvex analysis in abstract vector spacesfractional programmingKuhn-Tucker-theorymathematical programmingnecessary optimality conditionsoptimal control problemPontryagin's maximum principleunconstrained optimization
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to calculus of variations and optimal control (49-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 operations research and mathematical programming (90-01) Convex programming (90C25) Nonlinear programming (90C30) Fractional programming (90C32) Applications of mathematical programming (90C90)
- Characterizations of optimal solution sets of convex infinite programs
- Existence results and gap functions for the generalized equilibrium problem with composed functions
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- A class of nondifferentiable continuous programming problems
- Minimax principles for convex eigenvalue problems
- A class of nondifferentiable control problems
- Generalized fractional programming duality: A parametric approach
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- Equivalence of a Ky Fan type minimax theorem and a Gordan type alternative theorem
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- Optimal control and invexity
- Use of reference points for solving MONLP problems
- A note on convex cones and constraint qualifications in infinite- dimensional vector spaces
- Linear programming with matrix variables
- Duality in generalized fractional programming via Farkas' lemma
- Generalizations of Slater's constraint qualification for infinite convex programs
- Programming with semilocally convex functions
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- A Farkas lemma for difference sublinear systems and quasidifferentiable programming
- Variational inequalities with cone constraints
- A Fritz John optimality condition using the approximate subdifferential
- Generalized second-order characterizations of convex functions
- The Lagrange approach to infinite linear programs
- Eigenvalues, eigenspaces and distances to subsets
- First and second-order optimality conditions for convex composite multiobjective optimization
- Asymptotic dual conditions characterizing optimality for infinite convex programs
- On variational problems involving higher order derivatives
- An efficient trust region method for unconstrained discrete-time optimal control problems
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- The finite criss-cross method for hyperbolic programming
- The principle and models of dynamic programming. II
- A general Farkas lemma and characterization of optimality for a nonsmooth program involving convex processes
- Complex minimax programming under generalized convexity
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- A short elementary proof of the Lagrange multiplier theorem
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Duality for generalized fractional programs involving n-set functions
- Sufficient optimality criteria and duality for multiobjective variational control problems with G-type I objective and constraint functions
- Farkas-type results for vector-valued functions with applications
- Some relations between variational-like inequality problems and vectorial optimization problems in Banach spaces
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Two-parameter ridge regression and its convergence to the eventual pairwise model
- Optimality conditions for strong vector equilibrium problems under a weak constraint qualification
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- Existence of solutions of bilevel strong vector equilibrium problems and their applications
- Pontryagin principle with a PDE: a unified approach
- 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
- Ekeland duality as a paradigm
- Symmetric dual fractional programming
- Generalized concavity and duality with a square root term
- Convexlike alternative theorems and mathematical programming
- Nondifferentiable optimization by smooth approximations
- Results of farkas type
- On duality for weakly minimized vector valued optimization problems
- On optimality conditions in nonsmooth inequality constrained minimization
- Nonlinear alternative theorems and nondifferentiable programming
- Nonsmooth multiobjective programming
- Weak minimization and duality
- On sensitivity analysis for multicriteria optimization
- Non-convex infinite games
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- Complete characterization of optimality for convex programming in banach spaces†
- Images of cones under linear mappings
- Generalized implicit function theorems when the derivative has no bounded inverse
- Implicit function theorems and lagrange multipliers
- Bibliography in fractional programming
- Asymptotic kuhn-tucker conditions in abstract spaces
- A generalized Farkas lemma with applications to quasidifferentiable programming
- On optimality in abstract convex programming
- Multiobjective fractional programming duality. a Lagrangian approach
- A duality theorem in Hilbert space
- On generalized convexity and duality with a square root term
- Stability analysis for point delay fractional description models via linear matrix inequalities
- Toland-singer formula cannot distinguish a global minimizer from a choice of stationary points*
- Global efficiency in multiobjective programming*
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
- Second-order conditions in c1, 1optimization with applications
- Solvability theorems for classes of difference convex functions
- On Quasidifferentiable Functions and Non-Differentiable Programming
- Linear multicriteria sensitivity and shadow costs
- Avoiding a Constraint Qualification
- Numerical methods of nonlinear optimal control based on mathematical programming
- Optimality conditions for bilevel programming: an approach through variational analysis
- Farkas' lemma: three decades of generalizations for mathematical optimization
- Regularity Conditions and Optimality in Vector Optimization
- Nonconvex theorems of the alternative and minimization
- A transposition theorem with applications to constrained optimal control problems
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- \(S\)-adapted equilibria in games played over event trees with coupled constraints
- Ghost penalties in nonconvex constrained optimization: diminishing stepsizes and iteration complexity
- Sufficiency and mixed type duality for multiobjective variational control problems involving \(\alpha\)-V-univexity
- On \(F\)-convex functions
- Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case
- Duality and infinite dimensional optimization
- Invexity in multifunction optimization
- On a weakly C-\epsilon-vector saddle point approach in weak vector problems
- New Farkas-type constraint qualifications in convex infinite programming
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)