Ladislav Luksan

Publication Activity (10 Years)

Years Active: 1982-2021
Publications (10 Years): 4

Top Topics

Optimization Method

Top Venues

J. Comput. Appl. Math.

Appl. Math. Comput.

Numer. Algorithms

Comput. Optim. Appl.

Publications

Jan Vlcek, Ladislav Luksan
Two limited-memory optimization methods with minimum violation of the previous secant conditions. Comput. Optim. Appl. 80 (3) (2021)
Jan Vlcek, Ladislav Luksan
Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization. Numer. Algorithms 80 (3) (2019)
Jan Vlcek, Ladislav Luksan
A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions. J. Comput. Appl. Math. 351 (2019)
Jan Vlcek, Ladislav Luksan
A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea. Optim. Methods Softw. 30 (3) (2015)
Ladislav Luksan, Jan Vlcek
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. Appl. Math. Comput. 235 (2014)
Jan Vlcek, Ladislav Luksan
Generalizations of the limited-memory BFGS method based on the quasi-product form of update. J. Comput. Appl. Math. 241 (2013)
Ladislav Luksan, Jan Vlcek
Recursive form of general limited memory variable metric methods. Kybernetika 49 (2) (2013)
Jan Vlcek, Ladislav Luksan
A conjugate directions approach to improve the limited-memory BFGS method. Appl. Math. Comput. 219 (3) (2012)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Primal interior point method for minimization of generalized minimax functions. Kybernetika 46 (4) (2010)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Primal Interior-Point Method for Large Sparse Minimax Optimization. Kybernetika 45 (5) (2009)
Jan Hartman, Ladislav Luksan, Jan Zítko
Automatic Differentiation and Its Program Realization. Kybernetika 45 (5) (2009)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Algorithm 896: LSA: Algorithms for large-scale optimization. ACM Trans. Math. Softw. 36 (3) (2009)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
optimization. Optim. Methods Softw. 22 (5) (2007)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Interior point methods for large-scale nonlinear programming. Optim. Methods Softw. 20 (4-5) (2005)
Ladislav Luksan, Ctirad Matonoha, Jan Vlcek
Interior-point method for non-linear non-convex optimization. Numer. Linear Algebra Appl. 11 (5-6) (2004)
Ladislav Luksan, Jan Vlcek
Algorithm 811: NDA: algorithms for nondifferentiable optimization. ACM Trans. Math. Softw. 27 (2) (2001)
Marko M. Mäkelä, M. Miettinen, Ladislav Luksan, Jan Vlcek
Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities. J. Glob. Optim. 14 (2) (1999)
Ladislav Luksan, Jan Vlcek
A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83 (1998)
Ladislav Luksan, Jan Vlcek
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems. Numer. Linear Algebra Appl. 5 (3) (1998)
Ladislav Luksan, Jan Vlcek
Optimization of dynamical systems. Kybernetika 32 (5) (1996)
Ladislav Luksan
Efficient trust region method for nonlinear least squares. Kybernetika 32 (2) (1996)
Ladislav Luksan
Combined trust region methods for nonlinear least squares. Kybernetika 32 (2) (1996)
Ladislav Luksan
Inexact trust region method for large sparse nonlinear least squares. Kybernetika 29 (4) (1993)
Ladislav Luksan
Computational experience with improved conjugate gradient methods for unconstrained minimization. Kybernetika 28 (4) (1992)
Ladislav Luksan
Computational experience with improved variable metric methods for unconstrained minimization. Kybernetika 26 (5) (1990)
Ladislav Luksan
A compact variable metric algorithm for nonlinear minimax approximation. Computing 36 (4) (1986)
Ladislav Luksan
Conjugate direction algorithms for extended conic functions. Kybernetika 22 (1) (1986)
Ladislav Luksan
Variable metric methods for a class of extended conic functions. Kybernetika 21 (2) (1985)
Ladislav Luksan
A compact variable metric algorithm for linearly constrained nonlinear minimax approximation. Kybernetika 21 (6) (1985)
Ladislav Luksan
An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. Kybernetika 21 (1) (1985)
Ladislav Luksan
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. Kybernetika 20 (6) (1984)
Ladislav Luksan
Variable metric methods for linearly constrained nonlinear minimax approximation. Computing 30 (4) (1983)
Ladislav Luksan
Quasi-Newton methods without projections for unconstrained minimization. Kybernetika 18 (4) (1982)
Ladislav Luksan
Variable metric method with limited storage for large-scale unconstrained minimization. Kybernetika 18 (6) (1982)
Ladislav Luksan
Quasi-Newton methods without projections for linearly constrained minimization. Kybernetika 18 (4) (1982)
Ladislav Luksan
New combined method for unconstrained minimization. Computing 28 (2) (1982)