• DML-CZ Home

65K05 Mathematical programming (87 articles)

• Markopoulos, Alexandros; Beremlijski, Petr; Vlach, Oldřich; Sadowská, Marie: Solution of 3D contact shape optimization problems with Coulomb friction based on TFETI. (English). Applications of Mathematics, vol. 68 (2023), issue 4, pp. 405-424
• 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
• 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
• Liu, Xiangjing; Liu, Sanyang: A smoothing Levenberg-Marquardt method for the complementarity problem over symmetric cone. (English). Applications of Mathematics, vol. 67 (2022), issue 1, pp. 49-64
• Jurečková, Jana; Picek, Jan; Schindler, Martin: Empirical regression quantile processes. (English). Applications of Mathematics, vol. 65 (2020), issue 3, pp. 257-269
• Scitovski, Rudolf; Sabo, Kristian: The adaptation of the $k$-means algorithm to solving the multiple ellipses detection problem by using an initial approximation obtained by the DIRECT global optimization algorithm. (English). Applications of Mathematics, vol. 64 (2019), issue 6, pp. 663-678
• Knobloch, Roman; Mlýnek, Jaroslav; Srb, Radek: The classic differential evolution algorithm and its convergence properties. (English). Applications of Mathematics, vol. 62 (2017), issue 2, pp. 197-208
• 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
• Pospíšil, Lukáš; Dostál, Zdeněk: Minimization of a convex quadratic function subject to separable conical constraints in granular dynamics. (English). In: Chleboun, J., Přikryl, P., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 8-13, 2014. Institute of Mathematics AS CR, Prague, 2015. pp. 175-180
• Vlček, Jan; Lukšan, Ladislav: A modified limited-memory BNS method for unconstrained minimization derived from the conjugate directions idea. (English). In: Chleboun, J., Přikryl, P., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 8-13, 2014. Institute of Mathematics AS CR, Prague, 2015. pp. 237-243
• Lukšan, Ladislav; Vlček, Jan: Nonlinear conjugate gradient methods. (English). In: Chleboun, J., Přikryl, P., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 8-13, 2014. Institute of Mathematics AS CR, Prague, 2015. pp. 130-135
• Andrášik, Richard: Nonlinear Rescaling Method and Self-concordant Functions. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 52 (2013), issue 2, pp. 5-19
• Bunker, Douglas; Han, Lixing; Zhang, Shuhua: A proximal ANLS algorithm for nonnegative tensor factorization with a periodic enhanced line search. (English). Applications of Mathematics, vol. 58 (2013), issue 5, pp. 493-509
• Haugen, Kjetil K.; Lanquepin-Chesnais, Guillaume; Olstad, Asmund: A fast Lagrangian heuristic for large-scale capacitated lot-size problems with restricted cost structures. (English). Kybernetika, vol. 48 (2012), issue 2, pp. 329-345
• Vlček, Jan; Lukšan, Ladislav: Modifications of the limited-memory BFGS method based on the idea of conjugate directions. (English). In: Chleboun, J., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 3-8, 2012. Institute of Mathematics AS CR, Prague, 2013. pp. 209-214
• 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
• Lin, Qun; Xu, Da; Zhang, Shuhua: Uniform $L^1$ error bounds for semi-discrete finite element solutions of evolutionary integral equations. (English). In: Brandts, J., Chleboun, J., Korotov, S., Segeth, K., Šístek, J. and Vejchodský, T. (eds.): Applications of Mathematics 2012, In honor of the 60th birthday of Michal Křížek. Proceedings. Prague, May 2-5, 2012. Institute of Mathematics AS CR, Prague, 2012. pp. 144-162
• Du, Shou-qiang; Gao, Yan: Global convergence property of modified Levenberg-Marquardt methods for nonsmooth equations. (English). Applications of Mathematics, vol. 56 (2011), issue 5, pp. 481-498
• 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
• Bütikofer, Stephan; Klatte, Diethard; Kummer, Bernd: On second–order Taylor expansion of critical values. (English). Kybernetika, vol. 46 (2010), issue 3, pp. 472-487
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: Robust preconditioners for the matrix free truncated Newton method. (English). In: Chleboun, J., Přikryl, P., Segeth, K. and Šístek, J. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 6-11, 2010. Institute of Mathematics AS CR, Prague, 2010. pp. 137-151
• Haugen, Kjetil K.; Olstad, Asmund; Bakhrankova, Krystsina; Van Eikenhorst, Erik: The single (and multi) item profit maximizing capacitated lot–size (PCLSP) problem with fixed prices and no set–up. (English). Kybernetika, vol. 46 (2010), issue 3, pp. 415-422
• 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
• Yu, Zhensheng; Li, Qiang: A self-adaptive trust region method for the extended linear complementarity problems. (English). Applications of Mathematics, vol. 54 (2009), issue 1, pp. 53-65
• Vlček, Jan; Lukšan, Ladislav: Limited-memory variable metric methods based on invariant matrices. (English). In: Chleboun, J., Přikryl, P., Segeth, K. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 1-6, 2008. Institute of Mathematics AS CR, Prague, 2008. pp. 226-232
• Lukšan, Ladislav; Matonoha, Ctirad; Vlček, Jan: On Lagrange multipliers of trust-region subproblems. (English). In: Chleboun, J., Přikryl, P., Segeth, K. and Vejchodský, T. (eds.): Programs and Algorithms of Numerical Mathematics. Proceedings of Seminar. Dolní Maxov, June 1-6, 2008. Institute of Mathematics AS CR, Prague, 2008. pp. 130-137
• Bartl, David: An application of semi-infinite linear programming: approximation of a continuous function by a polynomial. (English). Acta Mathematica Universitatis Ostraviensis, vol. 12 (2004), issue 1, pp. 3-11
• 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
• Diniz-Ehrhardt, M. A.; Dostál, Z.; Gomes-Ruggiero, M. A.; Martínez, J. M.; Santos, S. A.: Nonmonotone strategy for minimization of quadratics with simple constraints. (English). Applications of Mathematics, vol. 46 (2001), issue 5, pp. 321-338
• Dostál, Zdeněk: Inexact solution of auxiliary problems in Polyak type algorithms. (English). Acta Universitatis Palackianae Olomucensis. Facultas Rerum Naturalium. Mathematica, vol. 38 (1999), issue 1, pp. 25-30
• Tharwat, A.; Zimmermann, K.: Some optimization problems on solubility sets of separable Max-Min equations and inequalities. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 38 (1997), issue 2, pp. 45-57
• Lukšan, Ladislav: Combined trust region methods for nonlinear least squares. (English). Kybernetika, vol. 32 (1996), issue 2, pp. 121-138
• Lukšan, Ladislav: Efficient trust region method for nonlinear least squares. (English). Kybernetika, vol. 32 (1996), issue 2, pp. 105-120
• Lukšan, Ladislav: Inexact trust region method for large sparse nonlinear least squares. (English). Kybernetika, vol. 29 (1993), issue 4, pp. 305-324
• Lukšan, Ladislav: Computational experience with improved conjugate gradient methods for unconstrained minimization. (English). Kybernetika, vol. 28 (1992), issue 4, pp. 249-262
• Dostál, Zdeněk: On the penalty approximation of quadratic programming problem. (English). Kybernetika, vol. 27 (1991), issue 2, pp. 151-154
• Lukšan, Ladislav: Computational experience with improved variable metric methods for unconstrained minimization. (English). Kybernetika, vol. 26 (1990), issue 5, pp. 415-431
• Hlaváček, Ivan: Domain optimization in $3D$-axisymmetric elliptic problems by dual finite element method. (English). Aplikace matematiky, vol. 35 (1990), issue 3, pp. 225-236
• Kaňková, Vlasta: On the convergence rate of empirical estimates in chance constrained stochastic programming. (English). Kybernetika, vol. 26 (1990), issue 6, pp. 449-461
• Roubíček, Tomáš: Evaluation of Clarke's generalized gradient in optimization of variational inequalities. (English). Kybernetika, vol. 25 (1989), issue 3, pp. 157-168
• Jajou, Amer F.; Zimmermann, Karel: Max-separable equations and the set covering. (English). Acta Universitatis Carolinae. Mathematica et Physica, vol. 30 (1989), issue 1, pp. 13-21
• Tůma, Miroslav: A note on direct methods for approximations of sparse Hessian matrices. (English). Aplikace matematiky, vol. 33 (1988), issue 3, pp. 171-176
• Outrata, Jiří V.: A note on the usage of nondifferentiable exact penalties in some special optimization problems. (English). Kybernetika, vol. 24 (1988), issue 4, pp. 251-258
• Jakeš, Jaromír: A numerical method of fitting a multiparameter nonlinear function to experimental data in the $L_1$ norm. (English). Aplikace matematiky, vol. 33 (1988), issue 3, pp. 161-170
• Hudzovič, Peter: Quasi-Newton gradient method with analytical determination of the direction and length of step. (English). Kybernetika, vol. 24 (1988), issue 5, pp. 378-393
• Lepp, Riho: Approximate solution of stochastic programming problems with recourse. (English). Kybernetika, vol. 23 (1987), issue 6, pp. 476-482
• Lukšan, Ladislav: Conjugate direction algorithms for extended conic functions. (English). Kybernetika, vol. 22 (1986), issue 1, pp. 31-46
• Lukšan, Ladislav: Conjugate gradient algorithms for conic functions. (English). Aplikace matematiky, vol. 31 (1986), issue 6, pp. 427-440
• Lukšan, Ladislav: Dual method for solving a special problem of quadratic programming as a subproblem at nonlinear minimax approximation. (English). Aplikace matematiky, vol. 31 (1986), issue 5, pp. 379-395
• Zlobec, Sanjo: Regions of stability for ill-posed convex programs: An addendum. (English). Aplikace matematiky, vol. 31 (1986), issue 2, pp. 109-117
• Lukšan, Ladislav: A compact variable metric algorithm for linearly constrained nonlinear minimax approximation. (English). Kybernetika, vol. 21 (1985), issue 6, pp. 405-427
• Muu, Lê Dung: A convergent algorithm for solving linear programs with an additional reverse convex constraint. (English). Kybernetika, vol. 21 (1985), issue 6, pp. 428-435
• Lukšan, Ladislav: An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. (English). Kybernetika, vol. 21 (1985), issue 1, pp. 22-40
• Masarik, Jozef: A thermodynamically motivated optimization algorithm: Circular wheel balance optimization. (English). Aplikace matematiky, vol. 30 (1985), issue 6, pp. 413-424
• Lukšan, Ladislav: Variable metric methods for a class of extended conic functions. (English). Kybernetika, vol. 21 (1985), issue 2, pp. 96-107
• Lukšan, Ladislav: Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. (English). Kybernetika, vol. 20 (1984), issue 6, pp. 445-457
• 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
• Sloboda, Fridrich: An imperfect conjugate gradient algorithm. (English). Aplikace matematiky, vol. 27 (1982), issue 6, pp. 426-432
• Lukšan, Ladislav: Quasi-Newton methods without projections for linearly constrained minimization. (English). Kybernetika, vol. 18 (1982), issue 4, pp. 307-319
• Lukšan, Ladislav: Quasi-Newton methods without projections for unconstrained minimization. (English). Kybernetika, vol. 18 (1982), issue 4, pp. 290-306
• Ozawa, Masanori; Yanai, Hiroshi: Some notes on the quasi-Newton methods. (English). Aplikace matematiky, vol. 27 (1982), issue 6, pp. 433-445
• Lukšan, Ladislav: Variable metric method with limited storage for large-scale unconstrained minimization. (English). Kybernetika, vol. 18 (1982), issue 6, pp. 517-528
• 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
• Gosćiński, Andrzej; Zieliński, Krzysztof: The determination of direct control algorithms activation moments using a real-time scheduling algorithm. (English). Kybernetika, vol. 17 (1981), issue 6, pp. 534-548
• Kazakevich, Vil'yam V.; Mochalov, Ivan A.: Последовательные алгоритмы оптимизации. (Russian) [Sequential optimization algorithms]. Kybernetika, vol. 17 (1981), issue 2, pp. 140-146
• Žilinskas, Antanas: Algorithm. 44. MIMUN. Optimization of one-dimensional multimodal functions in the presence of noise. (English). Aplikace matematiky, vol. 25 (1980), issue 3, pp. 234-240
• Guldan, Filip: Maximization of distances of regular polygons on a circle. (English). Aplikace matematiky, vol. 25 (1980), issue 3, pp. 182-195
• Doležal, Jaroslav: Parameter optimization in nonzero-sum differential games. (English). Kybernetika, vol. 16 (1980), issue 1, pp. (54)-70
• 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
• Haslinger, Jaroslav: On numerical solution of a variational inequality of the 4th order by finite element method. (English). Aplikace matematiky, vol. 23 (1978), issue 5, pp. 334-345
• Doležal, Jaroslav; Fidler, Jiří: On the numerical solution of optimal control problems with constraints. (English). Kybernetika, vol. 14 (1978), issue 3, pp. (182)-188
• Fritzsch, Klaus: On the acceleration of adaptation processes by two-step principles. (English). Kybernetika, vol. 13 (1977), issue 4, pp. (274)-281
• Vostrý, Zdeněk: New algorithm for polynomial spectral factorization with quadratic convergence. II. (English). Kybernetika, vol. 12 (1976), issue 4, pp. (248)-259
• Sloboda, Fridrich: Nonlinear iterative methods and parallel computation. (English). Aplikace matematiky, vol. 21 (1976), issue 4, pp. 252-262
• Outrata, Jiří V.: The second-order methods in discrete optimal control problems. (English). Kybernetika, vol. 12 (1976), issue 1, pp. (38)-45
• 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
• Canh, Nguyen; Tuzar, Antonín: An approximative method for solving the non-linear optimal control problem. (English). Kybernetika, vol. 11 (1975), issue 3, pp. (234)-247
• Vostrý, Zdeněk: New algorithm for polynomial spectral factorization with quadratic convergence. I. (English). Kybernetika, vol. 11 (1975), issue 6, pp. (415)-422
• Křížek, Miroslav: On the convergence of modified relaxation methods for extremum problems. (English). Aplikace matematiky, vol. 20 (1975), issue 5, pp. 359-371
• Sloboda, Fridrich: Parallel method of conjugate directions for minimization. (English). Aplikace matematiky, vol. 20 (1975), issue 6, pp. 436-446
• Šisler, Miroslav: Bemerkungen zur Optimierung eines gewissen Iterationsverfahrens. (German) [Remarks on optimization of certain iteration method]. Aplikace matematiky, vol. 18 (1973), issue 5, pp. 315-324
• Vil'ner, I. A.; Galajda, Pavel: Схема многомерной номографической модели для выбора оптимального решения общей задачи линейного программирования. (Russian) [Scheme of a multidimensional nomographic model for the selection of the optimal solution of a general linear programming problem]. Aplikace matematiky, vol. 18 (1973), issue 3, pp. 188-203
• Hrouda, Jaroslav: A contribution to Balas' algorithm. (English). Aplikace matematiky, vol. 16 (1971), issue 5, pp. 336-353
• Hrouda, Jaroslav: Staging in Balas' algorithm. (English). Aplikace matematiky, vol. 16 (1971), issue 5, pp. 354-369
• Častorál, Zdeněk: Некоторые общие алгоритмы обучения. (Russian) [Certain general teaching algorithms]. Kybernetika, vol. 7 (1971), issue 5, pp. (377)-385
• Žáčková, Jitka: On maximizing a concave function subject to linear constraints by Newton's method. (English). Aplikace matematiky, vol. 13 (1968), issue 4, pp. 339-355