A class of continuous convex programming problems
From MaRDI portal
Publication:2535945
Cites work
Cited in
(37)- Some existence and regularity results for dual linear control problems
- Sufficient optimality conditions in continuous-time nonlinear programming
- Optimality conditions and Lagrangian duality in continuous-time nonlinear programming
- The Fritz John and Kuhn-Tucker optimality conditions in continuous-time nonlinear programming
- Some remarks concerning duality for continuous-time programming problems
- Generalized Kuhn-Tucker conditions and duality for continuous nonlinear programming problems
- Optimality conditions and duality in continuous programming. I: Convex programs and a theorem of the alternative
- Sufficient optimality criteria in continuous time programming
- Continuous time programming with nonlinear constraints
- Saddle-point optimality criteria of continuous time programming without differentiability
- Saddlepoint of continuous time programming having inequality and equality constraints
- Continuous time programming with nonlinear time-delayed constraints
- Continuous time programming with set-inclusive constraints and objective set
- Numerical method for solving the continuous-time linear programming problems with time-dependent matrices and piecewise continuous functions
- On two duality theorems for continuous programming problems
- Continuous programming. I: Linear objectives
- Continuous programming. II: Nonlinear objectives
- Duality in continuous linear programming
- Generalized sufficiency criteria in continuous-time programming with application to a class of variational-type inequalities
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Approximate Solutions and Duality Theorems for Continuous-Time Linear Fractional Programming Problems
- KKT optimality conditions and nonsmooth continuous time optimization problems
- Approximate solutions and error bounds for a class of continuous-time linear programming problems
- Continuous-time Programming
- Optimality conditions in a vector continuous-time optimization problem
- Using the parametric approach to solve the continuous-time linear fractional Max-min problems
- Continuous-time linear programming problems revisited: a perturbation approach
- Optimality criteria and duality for nonlinear fractional continuous-time programming
- New optimality criteria for convex continuous-time problems of vector optimization
- Nonsmooth continuous-time optimization problems: Necessary conditions
- scientific article; zbMATH DE number 7685229 (Why is no real title available?)
- Using the Dinkelbach-type algorithm to solve the continuous-time linear fractional programming problems
- Necessary optimality conditions for Lyapunov-type optimization problem with state constraints
- Optimality conditions and duality for a class of continuous-time programming problems with nonlinear operator equality and inequality constraints
- A constant rank constraint qualification in continuous-time nonlinear programming
- Continuous-time optimization problems involving invex functions
- Vector continuous-time programming without differentiability
This page was built for publication: A class of continuous convex programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2535945)
