Ladislav Luksan

According to our database, Ladislav Luksan authored at least 36 papers between 1982 and 2021.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2021

Two limited-memory optimization methods with minimum violation of the previous secant conditions.

Jan Vlcek, Ladislav Luksan

Comput. Optim. Appl., 2021

2019

Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimization.

Jan Vlcek, Ladislav Luksan

Numer. Algorithms, 2019

A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directions.

Jan Vlcek, Ladislav Luksan

J. Comput. Appl. Math., 2019

2015

A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea.

Jan Vlcek, Ladislav Luksan

Optim. Methods Softw., 2015

2014

Efficient tridiagonal preconditioner for the matrix-free truncated Newton method.

Ladislav Luksan, Jan Vlcek

Appl. Math. Comput., 2014

2013

Recursive form of general limited memory variable metric methods.

Ladislav Luksan, Jan Vlcek

Kybernetika, 2013

Generalizations of the limited-memory BFGS method based on the quasi-product form of update.

Jan Vlcek, Ladislav Luksan

J. Comput. Appl. Math., 2013

2012

A conjugate directions approach to improve the limited-memory BFGS method.

Jan Vlcek, Ladislav Luksan

Appl. Math. Comput., 2012

2010

Primal interior point method for minimization of generalized minimax functions.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Kybernetika, 2010

2009

Algorithm 896: LSA: Algorithms for large-scale optimization.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

ACM Trans. Math. Softw., 2009

Primal Interior-Point Method for Large Sparse Minimax Optimization.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Kybernetika, 2009

Automatic Differentiation and Its Program Realization.

Jan Hartman, Ladislav Luksan, Jan Zítko

Kybernetika, 2009

2007

Trust-region interior-point method for large sparse <i>l</i> ₁ optimization.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Optim. Methods Softw., 2007

2005

Interior point methods for large-scale nonlinear programming.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Optim. Methods Softw., 2005

2004

Interior-point method for non-linear non-convex optimization.

Ladislav Luksan, Ctirad Matonoha, Jan Vlcek

Numer. Linear Algebra Appl., 2004

2001

Algorithm 811: NDA: algorithms for nondifferentiable optimization.

Ladislav Luksan, Jan Vlcek

ACM Trans. Math. Softw., 2001

1999

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities.

Marko M. Mäkelä, Markku Miettinen, Ladislav Luksan, Jan Vlcek

J. Glob. Optim., 1999

1998

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems.

Ladislav Luksan, Jan Vlcek

Numer. Linear Algebra Appl., 1998

A bundle-Newton method for nonsmooth unconstrained minimization.

Ladislav Luksan, Jan Vlcek

Math. Program., 1998

1996

Optimization of dynamical systems.

Ladislav Luksan, Jan Vlcek

Kybernetika, 1996

Combined trust region methods for nonlinear least squares.

Ladislav Luksan

Kybernetika, 1996

Efficient trust region method for nonlinear least squares.

Ladislav Luksan

Kybernetika, 1996

1993

Inexact trust region method for large sparse nonlinear least squares.

Ladislav Luksan

Kybernetika, 1993

1992

Computational experience with improved conjugate gradient methods for unconstrained minimization.

Ladislav Luksan

Kybernetika, 1992

1990

Computational experience with improved variable metric methods for unconstrained minimization.

Ladislav Luksan

Kybernetika, 1990

1986

Conjugate direction algorithms for extended conic functions.

Ladislav Luksan

Kybernetika, 1986

A compact variable metric algorithm for nonlinear minimax approximation.

Ladislav Luksan

Computing, 1986

1985

A compact variable metric algorithm for linearly constrained nonlinear minimax approximation.

Ladislav Luksan

Kybernetika, 1985

Variable metric methods for a class of extended conic functions.

Ladislav Luksan

Kybernetika, 1985

An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation.

Ladislav Luksan

Kybernetika, 1985

1984

Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation.

Ladislav Luksan

Kybernetika, 1984

1983

Variable metric methods for linearly constrained nonlinear minimax approximation.

Ladislav Luksan

Computing, 1983

1982

Variable metric method with limited storage for large-scale unconstrained minimization.

Ladislav Luksan

Kybernetika, 1982

Quasi-Newton methods without projections for linearly constrained minimization.

Ladislav Luksan

Kybernetika, 1982

Quasi-Newton methods without projections for unconstrained minimization.

Ladislav Luksan

Kybernetika, 1982

New combined method for unconstrained minimization.

Ladislav Luksan

Computing, 1982