Ladislav Luksan - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 35 from 35

2021

Two limited-memory optimization methods with minimum violation of the previous secant conditionsJan Vlcek, Ladislav Luksan. coap, 80(3):755-780, 2021. [doi]

2019

A limited-memory optimization method using the infinitely many times repeated BNS update and conjugate directionsJan Vlcek, Ladislav Luksan. jcam, 351:14-28, 2019. [doi]

Properties of the block BFGS update and its application to the limited-memory block BNS method for unconstrained minimizationJan Vlcek, Ladislav Luksan. na, 80(3):957-987, 2019. [doi]

2015

A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions ideaJan Vlcek, Ladislav Luksan. oms, 30(3):616-633, 2015. [doi]

2014

Efficient tridiagonal preconditioner for the matrix-free truncated Newton methodLadislav Luksan, Jan Vlcek. amc, 235:394-407, 2014. [doi]

2013

Recursive form of general limited memory variable metric methodsLadislav Luksan, Jan Vlcek. kybernetika, 49(2):224-235, 2013. [doi]

Generalizations of the limited-memory BFGS method based on the quasi-product form of updateJan Vlcek, Ladislav Luksan. jcam, 241:116-129, 2013. [doi]

2012

A conjugate directions approach to improve the limited-memory BFGS methodJan Vlcek, Ladislav Luksan. amc, 219(3):800-809, 2012. [doi]

2010

Primal interior point method for minimization of generalized minimax functionsLadislav Luksan, Ctirad Matonoha, Jan Vlcek. kybernetika, 46(4):697-721, 2010. [doi]

2009

Automatic Differentiation and Its Program RealizationJan Hartman, Ladislav Luksan, Jan Zítko. kybernetika, 45(5):865-883, 2009. [doi]

Algorithm 896: LSA: Algorithms for large-scale optimizationLadislav Luksan, Ctirad Matonoha, Jan Vlcek. TOMS, 36(3), 2009. [doi]

Primal Interior-Point Method for Large Sparse Minimax OptimizationLadislav Luksan, Ctirad Matonoha, Jan Vlcek. kybernetika, 45(5):841-864, 2009. [doi]

2007

1 optimizationLadislav Luksan, Ctirad Matonoha, Jan Vlcek. oms, 22(5):737-753, 2007. [doi]

2005

Interior point methods for large-scale nonlinear programmingLadislav Luksan, Ctirad Matonoha, Jan Vlcek. oms, 20(4-5):569-582, 2005. [doi]

2004

Interior-point method for non-linear non-convex optimizationLadislav Luksan, Ctirad Matonoha, Jan Vlcek. nla, 11(5-6):431-453, 2004. [doi]

2001

Algorithm 811: NDA: algorithms for nondifferentiable optimizationLadislav Luksan, Jan Vlcek. TOMS, 27(2):193-213, 2001. [doi]

1999

Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational InequalitiesMarko M. Mäkelä, M. Miettinen, Ladislav Luksan, Jan Vlcek. jgo, 14(2):117-135, 1999. [doi]

1998

A bundle-Newton method for nonsmooth unconstrained minimizationLadislav Luksan, Jan Vlcek. mp, 83:373-391, 1998.

Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problemsLadislav Luksan, Jan Vlcek. nla, 5(3):219-247, 1998. [doi]

1996

Efficient trust region method for nonlinear least squaresLadislav Luksan. kybernetika, 32(2):105-120, 1996. [doi]

Optimization of dynamical systemsLadislav Luksan, Jan Vlcek. kybernetika, 32(5):465-482, 1996. [doi]

Combined trust region methods for nonlinear least squaresLadislav Luksan. kybernetika, 32(2):121-138, 1996. [doi]

1993

Inexact trust region method for large sparse nonlinear least squaresLadislav Luksan. kybernetika, 29(4):305-324, 1993. [doi]

1992

Computational experience with improved conjugate gradient methods for unconstrained minimizationLadislav Luksan. kybernetika, 28(4):249-262, 1992. [doi]

1990

Computational experience with improved variable metric methods for unconstrained minimizationLadislav Luksan. kybernetika, 26(5):415-431, 1990. [doi]

1986

A compact variable metric algorithm for nonlinear minimax approximationLadislav Luksan. computing, 36(4):355-373, 1986. [doi]

Conjugate direction algorithms for extended conic functionsLadislav Luksan. kybernetika, 22(1):31-46, 1986. [doi]

1985

An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximationLadislav Luksan. kybernetika, 21(1):22-40, 1985. [doi]

A compact variable metric algorithm for linearly constrained nonlinear minimax approximationLadislav Luksan. kybernetika, 21(6):405-427, 1985. [doi]

Variable metric methods for a class of extended conic functionsLadislav Luksan. kybernetika, 21(2):96-107, 1985. [doi]

1984

Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximationLadislav Luksan. kybernetika, 20(6):445-457, 1984. [doi]

1982

New combined method for unconstrained minimizationLadislav Luksan. computing, 28(2):155-169, 1982. [doi]

Quasi-Newton methods without projections for linearly constrained minimizationLadislav Luksan. kybernetika, 18(4):307-319, 1982. [doi]

Quasi-Newton methods without projections for unconstrained minimizationLadislav Luksan. kybernetika, 18(4):290-306, 1982. [doi]

Variable metric method with limited storage for large-scale unconstrained minimizationLadislav Luksan. kybernetika, 18(6):517-528, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL