scientific article
From MaRDI portal
Publication:3101681
zbMath1251.90002MaRDI QIDQ3101681
Publication date: 30 November 2011
Full work available at URL: http://www.crcnetbase.com/isbn/9781439868232
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Convex programming (90C25) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Convexity of real functions of several variables, generalizations (26B25)
Related Items
An approach to characterizing \(\epsilon\)-solution sets of convex programs ⋮ Optimality conditions and a barrier method in optimization with convex geometric constraint ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Detecting invariant expanding cones for generating word sets to identify chaos in piecewise-linear maps ⋮ Approximate solutions of interval-valued optimization problems ⋮ The second boundary value problem for a discrete Monge-Ampère equation ⋮ On approximate optimality conditions for robust multi-objective convex optimization problems ⋮ A characterization of the $\varepsilon$-normal set and its application in robust convex optimization problems ⋮ Sufficient Optimality Conditions for a Bilevel Semivectorial D.C. Problem ⋮ On solving a class of fractional semi-infinite polynomial programming problems ⋮ DC approach to weakly convex optimization and nonconvex quadratic optimization problems ⋮ A duality approach for a class of semivectorial bilevel programming problems ⋮ Optimality conditions for mixed discrete bilevel optimization problems ⋮ Characteristics of semi-convex frontier optimization ⋮ Simple bilevel programming and extensions ⋮ Unnamed Item ⋮ On approximate solutions of nondifferentiable vector optimization problems with cone-convex objectives ⋮ Optimality conditions in convex optimization with locally Lipschitz constraints ⋮ Semi-quasidifferentiability in nonsmooth nonconvex multiobjective optimization ⋮ On a weakly C-$\epsilon$-vector saddle point approach in weak vector problems ⋮ Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. ⋮ A hybrid subgradient algorithm for finding a common solution of an equilibrium problem and a family of strict pseudocontraction mappings ⋮ Necessary optimality conditions for optimistic bilevel programming problems using set-valued programming ⋮ Algorithms for Simple Bilevel Programming ⋮ On the solution of convex bilevel optimization problems
This page was built for publication:
