default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLadislav Luksan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2021
[j36]Jan Vlcek
, Ladislav Luksan:
Two limited-memory optimization methods with minimum violation of the previous secant conditions. Comput. Optim. Appl. 80(3): 755-780 (2021)- 2019
- [j35]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: 14-28 (2019) - [j34]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): 957-987 (2019) - 2015
- [j33]Jan Vlcek, Ladislav Luksan:
A modified limited-memory BNS method for unconstrained minimization based on the conjugate directions idea. Optim. Methods Softw. 30(3): 616-633 (2015) - 2014
- [j32]Ladislav Luksan, Jan Vlcek:
Efficient tridiagonal preconditioner for the matrix-free truncated Newton method. Appl. Math. Comput. 235: 394-407 (2014) - 2013
- [j31]Jan Vlcek, Ladislav Luksan:
Generalizations of the limited-memory BFGS method based on the quasi-product form of update. J. Comput. Appl. Math. 241: 116-129 (2013) - [j30]Ladislav Luksan, Jan Vlcek:
Recursive form of general limited memory variable metric methods. Kybernetika 49(2): 224-235 (2013) - 2012
- [j29]Jan Vlcek, Ladislav Luksan:
A conjugate directions approach to improve the limited-memory BFGS method. Appl. Math. Comput. 219(3): 800-809 (2012) - 2010
- [j28]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Primal interior point method for minimization of generalized minimax functions. Kybernetika 46(4): 697-721 (2010) - 2009
- [j27]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Primal Interior-Point Method for Large Sparse Minimax Optimization. Kybernetika 45(5): 841-864 (2009) - [j26]Jan Hartman, Ladislav Luksan, Jan Zítko:
Automatic Differentiation and Its Program Realization. Kybernetika 45(5): 865-883 (2009) - [j25]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Algorithm 896: LSA: Algorithms for large-scale optimization. ACM Trans. Math. Softw. 36(3): 16:1-16:29 (2009) - 2007
- [j24]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Trust-region interior-point method for large sparse l 1 optimization. Optim. Methods Softw. 22(5): 737-753 (2007) - 2005
- [j23]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Interior point methods for large-scale nonlinear programming. Optim. Methods Softw. 20(4-5): 569-582 (2005) - 2004
- [j22]Ladislav Luksan, Ctirad Matonoha, Jan Vlcek:
Interior-point method for non-linear non-convex optimization. Numer. Linear Algebra Appl. 11(5-6): 431-453 (2004) - 2001
- [j21]Ladislav Luksan, Jan Vlcek:
Algorithm 811: NDA: algorithms for nondifferentiable optimization. ACM Trans. Math. Softw. 27(2): 193-213 (2001) - 1999
- [j20]Marko M. Mäkelä, Markku Miettinen, Ladislav Luksan, Jan Vlcek:
Comparing Nonsmooth Nonconvex Bundle Methods in Solving Hemivariational Inequalities. J. Glob. Optim. 14(2): 117-135 (1999) - 1998
- [j19]Ladislav Luksan, Jan Vlcek:
A bundle-Newton method for nonsmooth unconstrained minimization. Math. Program. 83: 373-391 (1998) - [j18]Ladislav Luksan, Jan Vlcek:
Indefinitely preconditioned inexact Newton method for large sparse equality constrained non-linear programming problems. Numer. Linear Algebra Appl. 5(3): 219-247 (1998) - 1996
- [j17]Ladislav Luksan:
Efficient trust region method for nonlinear least squares. Kybernetika 32(2): 105-120 (1996) - [j16]Ladislav Luksan:
Combined trust region methods for nonlinear least squares. Kybernetika 32(2): 121-138 (1996) - [j15]Ladislav Luksan, Jan Vlcek:
Optimization of dynamical systems. Kybernetika 32(5): 465-482 (1996) - 1993
- [j14]Ladislav Luksan:
Inexact trust region method for large sparse nonlinear least squares. Kybernetika 29(4): 305-324 (1993) - 1992
- [j13]Ladislav Luksan:
Computational experience with improved conjugate gradient methods for unconstrained minimization. Kybernetika 28(4): 249-262 (1992) - 1990
- [j12]Ladislav Luksan:
Computational experience with improved variable metric methods for unconstrained minimization. Kybernetika 26(5): 415-431 (1990) - 1986
- [j11]Ladislav Luksan:
A compact variable metric algorithm for nonlinear minimax approximation. Computing 36(4): 355-373 (1986) - [j10]Ladislav Luksan:
Conjugate direction algorithms for extended conic functions. Kybernetika 22(1): 31-46 (1986) - 1985
- [j9]Ladislav Luksan:
An implementation of recursive quadratic programming variable metric methods for linearly constrained nonlinear minimax approximation. Kybernetika 21(1): 22-40 (1985) - [j8]Ladislav Luksan:
Variable metric methods for a class of extended conic functions. Kybernetika 21(2): 96-107 (1985) - [j7]Ladislav Luksan:
A compact variable metric algorithm for linearly constrained nonlinear minimax approximation. Kybernetika 21(6): 405-427 (1985) - 1984
- [j6]Ladislav Luksan:
Dual method for solving a special problem of quadratic programming as a subproblem at linearly constrained nonlinear minimax approximation. Kybernetika 20(6): 445-457 (1984) - 1983
- [j5]Ladislav Luksan:
Variable metric methods for linearly constrained nonlinear minimax approximation. Computing 30(4): 315-334 (1983) - 1982
- [j4]Ladislav Luksan:
New combined method for unconstrained minimization. Computing 28(2): 155-169 (1982) - [j3]Ladislav Luksan:
Quasi-Newton methods without projections for unconstrained minimization. Kybernetika 18(4): 290-306 (1982) - [j2]Ladislav Luksan:
Quasi-Newton methods without projections for linearly constrained minimization. Kybernetika 18(4): 307-319 (1982) - [j1]Ladislav Luksan:
Variable metric method with limited storage for large-scale unconstrained minimization. Kybernetika 18(6): 517-528 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
