About a special class of nonconvex optimization problems

Libuše Grygarová

Aplikace matematiky (1990)

  • Volume: 35, Issue: 2, page 147-157
  • ISSN: 0862-7940

Abstract

top
The article deals with certain nonconvex optimization problem which have features analogous to those of the linear optimization problems. We can find their absolute extrema and the set all optimal points of such nonconvex optimization problem represents the closure of a face of a spherical polyhedron which is its feasible set.

How to cite

top

Grygarová, Libuše. "About a special class of nonconvex optimization problems." Aplikace matematiky 35.2 (1990): 147-157. <http://eudml.org/doc/15618>.

@article{Grygarová1990,
abstract = {The article deals with certain nonconvex optimization problem which have features analogous to those of the linear optimization problems. We can find their absolute extrema and the set all optimal points of such nonconvex optimization problem represents the closure of a face of a spherical polyhedron which is its feasible set.},
author = {Grygarová, Libuše},
journal = {Aplikace matematiky},
keywords = {nonconvex optimization problem; spherical polyhedron; face of a spherical polyhedron; optimality criterion; spherical polyhedron; optimality criterion},
language = {eng},
number = {2},
pages = {147-157},
publisher = {Institute of Mathematics, Academy of Sciences of the Czech Republic},
title = {About a special class of nonconvex optimization problems},
url = {http://eudml.org/doc/15618},
volume = {35},
year = {1990},
}

TY - JOUR
AU - Grygarová, Libuše
TI - About a special class of nonconvex optimization problems
JO - Aplikace matematiky
PY - 1990
PB - Institute of Mathematics, Academy of Sciences of the Czech Republic
VL - 35
IS - 2
SP - 147
EP - 157
AB - The article deals with certain nonconvex optimization problem which have features analogous to those of the linear optimization problems. We can find their absolute extrema and the set all optimal points of such nonconvex optimization problem represents the closure of a face of a spherical polyhedron which is its feasible set.
LA - eng
KW - nonconvex optimization problem; spherical polyhedron; face of a spherical polyhedron; optimality criterion; spherical polyhedron; optimality criterion
UR - http://eudml.org/doc/15618
ER -

References

top
  1. F. Nožička L. Grygarová K. Lommatzsch, Geometrie konvexer Mengen und konvexe Analysis, Akademie-Verlag, Berlin. 1988. (1988) MR0966885
  2. F. Nožička J. Guddat H. Hollatz B. Bank, Theorie der linearen parametrischen Optimierung, Akademie-Verlag, Berlin. 1974. (1974) Zbl0284.90053

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.