90 Operations research, mathematical programming
90C25 Convex programming (59 articles)
-
Daili, Chafia; Achache, Mohamed:
An interior-point algorithm for semidefinite least-squares problems.
(English).
Applications of Mathematics,
vol. 67
(2022),
issue 3,
pp. 371-391
-
Yin, Lulu; Liu, Hongwei; Yang, Jun:
Modified golden ratio algorithms for pseudomonotone equilibrium problems and variational inequalities.
(English).
Applications of Mathematics,
vol. 67
(2022),
issue 3,
pp. 273-296
-
Tang, Jingyong; Chen, Yuefen:
Smoothing functions and algorithm for nonsymmetric circular cone complementarity problems.
(English).
Applications of Mathematics,
vol. 67
(2022),
issue 2,
pp. 209-231
-
-
Wang, Xue-Fang; Deng, Zhenhua; Ma, Song; Du, Xian:
Event-triggered design for multi-agent optimal consensus of Euler-Lagrangian systems.
(English).
Kybernetika,
vol. 53
(2017),
issue 1,
pp. 179-194
-
Rajmic, Pavel; Novosadová, Michaela; Daňková, Marie:
Piecewise-polynomial signal segmentation using convex optimization.
(English).
Kybernetika,
vol. 53
(2017),
issue 6,
pp. 1131-1149
-
Kůdela, Jakub; Popela, Pavel:
Warm-start cuts for Generalized Benders Decomposition.
(English).
Kybernetika,
vol. 53
(2017),
issue 6,
pp. 1012-1025
-
Haslinger, Jaroslav; Repin, Sergey; Sysala, Stanislav:
Guaranteed and computable bounds of the limit load for variational problems with linear growth energy functionals.
(English).
Applications of Mathematics,
vol. 61
(2016),
issue 5,
pp. 527-564
-
-
Kimiaei, Morteza; Rostami, Majid:
Impulse noise removal based on new hybrid conjugate gradient approach.
(English).
Kybernetika,
vol. 52
(2016),
issue 5,
pp. 791-823
-
Tang, Jingyong; Dong, Li; Fang, Liang; Sun, Li:
Analysis of a non-monotone smoothing-type algorithm for the second-order cone programming.
(English).
Applications of Mathematics,
vol. 60
(2015),
issue 1,
pp. 35-49
-
Dang, Yazheng; Gao, Yan:
A new simultaneous subgradient projection algorithm for solving a multiple-sets split feasibility problem.
(English).
Applications of Mathematics,
vol. 59
(2014),
issue 1,
pp. 37-51
-
Tapia, Alán; Márquez, Raymundo; Bernal, Miguel; Cortez, Joaquín:
Sliding subspace design based on linear matrix inequalities.
(English).
Kybernetika,
vol. 50
(2014),
issue 3,
pp. 436-449
-
Salahi, Maziar; Fallahi, Saeed:
Linear fractional program under interval and ellipsoidal uncertainty.
(English).
Kybernetika,
vol. 49
(2013),
issue 1,
pp. 181-187
-
Kheirfam, Behrouz; Mahdavi-Amiri, Nezam:
New complexity analysis of a full Nesterov- Todd step infeasible interior-point algorithm for symmetric optimization.
(English).
Kybernetika,
vol. 49
(2013),
issue 6,
pp. 883-896
-
Tang, Jingyong; He, Guoping; Dong, Li; Fang, Liang; Zhou, Jinchuan:
A smoothing Newton method for the second-order cone complementarity problem.
(English).
Applications of Mathematics,
vol. 58
(2013),
issue 2,
pp. 223-247
-
Tang, Jingyong; He, Guoping; Dong, Li; Fang, Liang:
A new one-step smoothing newton method for second-order cone programming.
(English).
Applications of Mathematics,
vol. 57
(2012),
issue 4,
pp. 311-331
-
Fang, Liang:
A new non-interior continuation method for $P_0$-NCP based on a SSPM-function.
(English).
Applications of Mathematics,
vol. 56
(2011),
issue 4,
pp. 389-403
-
Fang, Liang; He, Guoping; Sun, Li:
A globally convergent non-interior point algorithm with full Newton step for second-order cone programming.
(English).
Applications of Mathematics,
vol. 54
(2009),
issue 5,
pp. 447-464
-
Hilli, Petri; Pennanen, Teemu:
Numerical study of discretizations of multistage stochastic programs.
(English).
Kybernetika,
vol. 44
(2008),
issue 2,
pp. 185-204
-
Kopa, Miloš; Chovanec, Petr:
A second-order stochastic dominance portfolio efficiency measure.
(English).
Kybernetika,
vol. 44
(2008),
issue 2,
pp. 243-258
-
Crombez, G.:
A sequential iteration algorithm with non-monotoneous behaviour in the method of projections onto convex sets.
(English).
Czechoslovak Mathematical Journal,
vol. 56
(2006),
issue 2,
pp. 491-506
-
Knobloch, Matthias:
Solving convex program via Lagrangian decomposition.
(English).
Kybernetika,
vol. 40
(2004),
issue 5,
pp. [595]-610
-
Crombez, Gilbert:
Non-monotoneous parallel iteration for solving convex feasibility problems.
(English).
Kybernetika,
vol. 39
(2003),
issue 5,
pp. [547]-560
-
Lukšan, Ladislav:
Inexact trust region method for large sparse nonlinear least squares.
(English).
Kybernetika,
vol. 29
(1993),
issue 4,
pp. 305-324
-
Pelant, Jan; Poljak, Svatopluk; Turzík, Daniel:
Limit behaviour of trajectories involving subgradients of convex functions.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 28
(1987),
issue 3,
pp. 457-466
-
Chien, Tran Quoc:
Perturbation theory of duality in vector optimization via the abstract duality scheme.
(English).
Kybernetika,
vol. 23
(1987),
issue 1,
pp. 67-81
-
Durdil, J.:
On strong continuity of derivatives of mappings.
(English).
Acta Universitatis Carolinae. Mathematica et Physica,
vol. 27
(1986),
issue 1,
pp. 17-27
-
Zlobec, Sanjo:
Regions of stability for ill-posed convex programs: An addendum.
(English).
Aplikace matematiky,
vol. 31
(1986),
issue 2,
pp. 109-117
-
Chien, Tran Quoc:
Duality and optimality conditions in abstract concave maximization.
(English).
Kybernetika,
vol. 21
(1985),
issue 2,
pp. 108-117
-
-
Swartz, Charles:
The Farkas lemma of Glover.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 26
(1985),
issue 4,
pp. 651-654
-
Le Van Hot:
On the open mapping principle and convex multivalued mappings.
(English).
Acta Universitatis Carolinae. Mathematica et Physica,
vol. 26
(1985),
issue 1,
pp. 53-59
-
Chien, Tran Quoc:
Duality in vector optimization. II. Vector quasiconcave programming.
(English).
Kybernetika,
vol. 20
(1984),
issue 5,
pp. 386-404
-
Iusem, A.; de Pierro, A.:
On the set of weighted least squares solutions of systems of convex inequalities.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 25
(1984),
issue 4,
pp. 667-678
-
Zlobec, Sanjo:
Two characterizations of Pareto minima in convex multicriteria optimization.
(English).
Aplikace matematiky,
vol. 29
(1984),
issue 5,
pp. 342-349
-
Mikulecká, Jaroslava:
On a hybrid experimental design.
(English).
Kybernetika,
vol. 19
(1983),
issue 1,
pp. 1-14
-
Sloboda, Fridrich:
An imperfect conjugate gradient algorithm.
(English).
Aplikace matematiky,
vol. 27
(1982),
issue 6,
pp. 426-432
-
Doležal, Jaroslav:
Mathematical programming problems involving continuum of inequality constraints.
(English).
Kybernetika,
vol. 18
(1982),
issue 1,
pp. 31-36
-
Outrata, Jiří V.; Jarušek, Jiří:
On Fenchel dual schemes in convex optimal control problems.
(English).
Kybernetika,
vol. 18
(1982),
issue 1,
pp. 1-21
-
Zlobec, Sanjo:
Regions of stability for ill-posed convex programs.
(English).
Aplikace matematiky,
vol. 27
(1982),
issue 3,
pp. 176-191
-
Oelschlägel, Dieter; Süsse, Herbert:
Bemerkungen zum Verfahren der koordinatenweisen Suche.
(German) [Remarks on the method of coordinatewise search].
Aplikace matematiky,
vol. 26
(1981),
issue 3,
pp. 202-210
-
Jokl, Luděk:
An application of the Hahn-Banach theorem in convex analysis.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 22
(1981),
issue 4,
pp. 799-807
-
Nehse, Reinhard:
A new concept of separation.
(English).
Commentationes Mathematicae Universitatis Carolinae,
vol. 22
(1981),
issue 1,
pp. 169-179
-
Grygarová, Libuše:
Asymptotische Berührung $k$-ter Ordnung konvexer Mengen.
(German) [Asymptotic contact of the $k$-th order of convex sets].
Aplikace matematiky,
vol. 25
(1980),
issue 3,
pp. 209-220
-
Grygarová, Libuše:
Zur asymptotischen Berührung von konvexen Mengen.
(German) [On asymptotic contact of convex sets].
Aplikace matematiky,
vol. 25
(1980),
issue 3,
pp. 221-228
-
Outrata, Jiří V.; Kříž, Otakar F.:
An application of conjugate duality for numerical solution of continuous convex optimal control problems.
(English).
Kybernetika,
vol. 16
(1980),
issue 6,
pp. (477)-497
-
Bair, Jacques; Vangeldère, Joseph:
Équivalences concernant la séparation de plusieurs cônes convexes.
(French) [On equivalences concerning the separation of several convex cones].
Commentationes Mathematicae Universitatis Carolinae,
vol. 21
(1980),
issue 3,
pp. 535-549
-
Grygarová, Libuše:
Asymptotische Berührung von zwei konvexen Mengen in (bestimmter) Richtung.
(German) [Asymptotic contact of two convex sets in (a certain) direction].
Aplikace matematiky,
vol. 24
(1979),
issue 1,
pp. 32-47
-
Grygarová, Libuše:
Sphärische Abbildung konvexer abgeschlossener Mengen in $E_n$ und ihre charakteristischen Eigenschaften.
(German) [Spherical mapping of convex closed sets in $\bold E_n$ and its characteristic properties].
Aplikace matematiky,
vol. 23
(1978),
issue 2,
pp. 115-131
-
Donath, Gerhard; Elster, Karl-Heinz:
Zur Konvergenz des Verfahrens der Koordinatenweisensuche.
(German) [On convergence of the coordinate search method].
Aplikace matematiky,
vol. 23
(1978),
issue 3,
pp. 161-173
-
Grygarová, Libuše:
Über Punktberührung von konvexen Mengen.
(German) [On a point contact of convex sets].
Aplikace matematiky,
vol. 23
(1978),
issue 6,
pp. 453-466
-
Grygarová, Libuše:
Lokale Berührungskegel einer Menge im Euklidischen Raum $E_n$.
(German) [Local contact cone of a set in the Euclidean space $\bold E_n$].
Aplikace matematiky,
vol. 22
(1977),
issue 2,
pp. 110-115
-
Osman, Mohamed Sayed Ali:
Qualitative analysis of basic notions in parametric convex programming. I. Parameters in the constraints.
(English).
Aplikace matematiky,
vol. 22
(1977),
issue 5,
pp. 318-332
-
Osman, Mohamed Sayed Ali:
Qualitative analysis of basic notions in parametric convex programming. II. Parameters in the objective function.
(English).
Aplikace matematiky,
vol. 22
(1977),
issue 5,
pp. 333-348
-
Tammer, Klaus:
Notwendige und hinreichende Bedingungen für (strenge) Konvexität, Pseudokonvexität und (strenge) Quasikonvexität einer quadratischen Funktion bezüglich einer konvexen Menge.
(German) [Necessary and sufficient conditions for (strict) convexity, pseudoconvexity and (strict) quasiconvexity of a quadratic function with respect to a convex domain].
Aplikace matematiky,
vol. 21
(1976),
issue 2,
pp. 97-110
-
Tammer, Klaus:
Über eine Klasse von verallgemeinerten quadratischen Optimierungsproblemen mit nichtkonvexer Zielfunktion, die auf quasi- bzw. pseudokonvexe Probleme zurückführbar sind.
(German) [On a class of generalized quadratic optimization problems with nonconvex objective function that can be reduced to quasi- or pseudoconvex problems].
Aplikace matematiky,
vol. 21
(1976),
issue 2,
pp. 111-119
-
Elster, K. H.; Götz, R.; Magerod, J.:
Kuhn-Tucker-Theorie für Funktionen mit Richtungsableitungen.
(German).
Matematický časopis,
vol. 24
(1974),
issue 1,
pp. 85-95
-
Morávek, Jaroslav:
A localization problem in geometry and complexity of discrete programming.
(English).
Kybernetika,
vol. 8
(1972),
issue 6,
pp. (498)-516