scientific article; zbMATH DE number 3672000
From MaRDI portal
Publication:3869074
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)- The Lagrange approach to infinite linear programs
- Global efficiency in multiobjective programming*
- Comments on: ``Farkas' lemma: three decades of generalizations for mathematical optimization
- Generalized convex composite multi-objective nonsmooth programming and conditional proper efficiency
- Diminishing stepsize methods for nonconvex composite problems via ghost penalties: from the general to the convex regular constrained case
- A general Farkas lemma
- Characterizing global optimality for DC optimization problems under convex inequality constraints
- Solvability results for sublinear functions and operators
- Existence results and gap functions for the generalized equilibrium problem with composed functions
- Proper efficiency in vector infinite programming problems
- Linear multicriteria sensitivity and shadow costs
- Existence of solutions of bilevel strong vector equilibrium problems and their applications
- Minimax principles for convex eigenvalue problems
- Linear programming with matrix variables
- A distributional Farkas' lemma and moment optimization problems with no-gap dual semi-definite programs
- Constraint qualifications characterizing Lagrangian duality in convex optimization
- Equivalence of saddle-points and optima, and duality for a class of non- smooth non-convex problems
- A transposition theorem with applications to constrained optimal control problems
- On variational problems involving higher order derivatives
- Multiobjective fractional programming duality. a Lagrangian approach
- Generalized concavity and duality with a square root term
- Convexlike alternative theorems and mathematical programming
- Implicit function theorems and lagrange multipliers
- Generalized fractional programming duality: A parametric approach
- Nonsmooth multiobjective programming
- Characterizations of optimal solution sets of convex infinite programs
- The finite criss-cross method for hyperbolic programming
- On rigidity and realizability of weighted graphs
- Nonlinear alternative theorems and nondifferentiable programming
- Programming with semilocally convex functions
- Invexity in multifunction optimization
- Farkas-type results for vector-valued functions with applications
- A duality theorem in Hilbert space
- On generalized convexity and duality with a square root term
- Asymptotic kuhn-tucker conditions in abstract spaces
- On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems
- Fractional programming
- Generalized implicit function theorems when the derivative has no bounded inverse
- Duality for generalized fractional programs involving n-set functions
- On Quasidifferentiable Functions and Non-Differentiable Programming
- 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
- An efficient trust region method for unconstrained discrete-time optimal control problems
- A complete algorithm for linear fractional programs
- Fractional programming
- A generalized Farkas lemma with applications to quasidifferentiable programming
- On duality for weakly minimized vector valued optimization problems
- A class of nondifferentiable continuous programming problems
- Farkas' lemma: three decades of generalizations for mathematical optimization
- On sensitivity analysis for multicriteria optimization
- Some relations between variational-like inequality problems and vectorial optimization problems in Banach spaces
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Nonlinear Lagrangian theory for nonconvex optimization.
- Some efficient algorithms for unconstrained discrete-time optimal control problems
- 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
- Use of reference points for solving MONLP problems
- Optimal control and invexity
- A generalized karush-kuhn-tucki optimality condition without constraint qualification using tl approximate subdifferential
- Two-parameter ridge regression and its convergence to the eventual pairwise model
- 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
- The Toland-Fenchel-Lagrange duality of DC programs for composite convex functions
- Solvability theorems for classes of difference convex functions
- Lagrange multipliers saddle points and scalarizations in composite multiobjective nonsmooth programming
- A note on convex cones and constraint qualifications in infinite- dimensional vector spaces
- Duality and infinite dimensional optimization
- Symmetric dual fractional programming
- Bibliography in fractional programming
- Complex minimax programming under generalized type-I functions
- On optimality in abstract convex programming
- Weak minimization and duality
- Optimality conditions for bilevel programming: an approach through variational analysis
- Duality in generalized fractional programming via Farkas' lemma
- On \(F\)-convex functions
- On classes of generalized convex functions, Gordan-Farkas type theorems, and Lagrangean duality
- Second-order conditions in c1, 1optimization with applications
- A generalization of a minimax theorem of Fan via a theorem of the alternative
- Necessary and Sufficient Optimality Conditions for Non-regular Problems
- Dynamic programming and inequalities
- Dynamic programming and penalty functions
- Ekeland duality as a paradigm
- New Farkas-type constraint qualifications in convex infinite programming
- Robust stability analysis and dynamic gain-scheduled controller design for point time-delay systems with parametrical uncertainties
- Variational inequalities with cone constraints
- Theorems of the alternative and optimality conditions for convexlike and general convexlike programming
- Non-convex infinite games
- Nondifferentiable optimization by smooth approximations
- A short elementary proof of the Lagrange multiplier theorem
- Fritz John Sufficient Optimality Conditions and Duality for a Generalised Minmax Program
- 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
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)
