scientific article; zbMATH DE number 3427125
From MaRDI portal
Publication:3214715
Methods involving semicontinuity and convergence; relaxation (49J45) Inequalities and extremum problems involving convexity in convex geometry (52A40) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Convex programming (90C25) 2-person games (91A05)
Cited in
(15)- On some efficient interior point methods for nonlinear convex programming
- Free trees and bidirectional trees as representations of psychological distance
- Controlled dual perturbations for central path trajectories in geometric programming
- Perturbation analysis of singular semidefinite programs and its applications to control problems
- Saddle-point type optimality criteria, duality and a new approach for solving nonsmooth fractional continuous-time programming problems
- Robustness of stochastic programs with endogenous randomness via contamination
- Saddle points and overdetermined complex equations
- Duality for generalized fractional programs involving n-set functions
- Certification aspects of the fast gradient method for solving the dual of parametric convex programs
- Asymptotics of minimax stochastic programs
- Optimality conditions and duality for a class of continuous-time generalized fractional programming problems
- Fractional programming
- Formalization of trellises and tolerance relations
- A nonsmooth approach to envelope theorems
- Generalized semi-infinite programming: a tutorial
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 Q3214715)
