Ladislav Luksan

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