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.

[BibT_eX]

[DOI]

Numer. Algorithms, 2019

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

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2019

2015

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

[BibT_eX]

[DOI]

Optim. Methods Softw., 2015

2014

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

[BibT_eX]

[DOI]

Appl. Math. Comput., 2014

2013

Recursive form of general limited memory variable metric methods.

[BibT_eX]

[DOI]

Kybernetika, 2013

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

[BibT_eX]

[DOI]

J. Comput. Appl. Math., 2013

2012

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

[BibT_eX]

[DOI]

Appl. Math. Comput., 2012

2010

Primal interior point method for minimization of generalized minimax functions.

[BibT_eX]

[DOI]

Kybernetika, 2010

2009

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

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2009

Primal Interior-Point Method for Large Sparse Minimax Optimization.

[BibT_eX]

[DOI]

Kybernetika, 2009

Automatic Differentiation and Its Program Realization.

[BibT_eX]

[DOI]

Jan Hartman

Jan Zítko

Kybernetika, 2009

2007

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

[BibT_eX]

[DOI]

Optim. Methods Softw., 2007

2005

Interior point methods for large-scale nonlinear programming.

[BibT_eX]

[DOI]

Optim. Methods Softw., 2005

2004

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

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 2004

2001

Algorithm 811: NDA: algorithms for nondifferentiable optimization.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2001

1999

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities.

[BibT_eX]

[DOI]

J. Glob. Optim., 1999

1998

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

[BibT_eX]

[DOI]

Numer. Linear Algebra Appl., 1998

A bundle-Newton method for nonsmooth unconstrained minimization.

[BibT_eX]

[DOI]

Math. Program., 1998

1996

Optimization of dynamical systems.

[BibT_eX]

[DOI]

Kybernetika, 1996

Combined trust region methods for nonlinear least squares.

[BibT_eX]

[DOI]

Kybernetika, 1996

Efficient trust region method for nonlinear least squares.

[BibT_eX]

[DOI]

Kybernetika, 1996

1993

Inexact trust region method for large sparse nonlinear least squares.

[BibT_eX]

[DOI]

Kybernetika, 1993

1992

Computational experience with improved conjugate gradient methods for unconstrained minimization.

[BibT_eX]

[DOI]

Kybernetika, 1992

1990

Computational experience with improved variable metric methods for unconstrained minimization.

[BibT_eX]

[DOI]

Kybernetika, 1990

1986

Conjugate direction algorithms for extended conic functions.

[BibT_eX]

[DOI]

Kybernetika, 1986

A compact variable metric algorithm for nonlinear minimax approximation.

[BibT_eX]

[DOI]

Computing, 1986

1985

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

[BibT_eX]

[DOI]

Kybernetika, 1985

Variable metric methods for a class of extended conic functions.

[BibT_eX]

[DOI]

Kybernetika, 1985

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

[BibT_eX]

[DOI]

Kybernetika, 1985

1984

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

[BibT_eX]

[DOI]

Kybernetika, 1984

1983

Variable metric methods for linearly constrained nonlinear minimax approximation.

[BibT_eX]

[DOI]

Computing, 1983

1982

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

[BibT_eX]

[DOI]

Kybernetika, 1982

Quasi-Newton methods without projections for linearly constrained minimization.

[BibT_eX]

[DOI]

Kybernetika, 1982

Quasi-Newton methods without projections for unconstrained minimization.

[BibT_eX]

[DOI]

Kybernetika, 1982

New combined method for unconstrained minimization.

[BibT_eX]

[DOI]