default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndreas Fischer 0004
Person information
- affiliation: Technical University of Dresden, Institute for Numerical Mathematics, Germany
- affiliation: University of Dortmund, Germany
Other persons with the same name
- Andreas Fischer — disambiguation page
- Andreas Fischer 0001
![[0000-0002-0074-5411]](https://dblp.dagstuhl.de/img/orcid-mark.12x12.png "0000-0002-0074-5411")
— Deggendorf Institute of Technology, Germany (and 2 more) - Andreas Fischer 0002 — Concordia University, Centre for Pattern Recognition and Machine Intelligence, Montreal, Canada (and 3 more)
- Andreas Fischer 0003 — Karlsruhe Institute of Technology, Department of Sport and Sport Science (ifSS), Germany
- Andreas Fischer 0005 — University of Bremen, BIMAQ, Germany (and 1 more)
- Andreas Fischer 0006 — Fraunhofer Institute for Manufacturing Engineering and Automation (IPA), Stuttgart, Germany
- Andreas Fischer 0007 — University of Hannover, Institute of Production Systems and Logistics, Germany
- Andreas Fischer 0008 — University of Saskatchewan, Department of Mathematics and Statistics, Saskatoon, Canada
- Andreas Fischer 0009 — University of Bremen, Institute for Dynamical Systems, Germany
- Andreas Fischer 0010 — Heidelberg University, Germany
- Andreas Fischer 0011 — SAP Karlsruhe, Germany
- Andreas Fischer 0012 — School of Engineering and Architecture of Fribourg (HEIA-FR), Institute of Complex Systems (iCoSys), Fribourg, Switzerland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j41]Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
The Levenberg-Marquardt method: an overview of modern convergence theories and more. Comput. Optim. Appl. 89(1): 33-67 (2024)- [j40]Andreas Fischer, Igor S. Litvinchev, Tetyana Romanova, Petro Stetsyuk, Georgiy Yaskov:
Packing spheres with quasi-containment conditions. J. Glob. Optim. 90(3): 671-689 (2024) - 2023
- [j39]Andreas Fischer, Alexey F. Izmailov, Mario Jelitte:
Stability of Singular Solutions of Nonlinear Equations with Restricted Smoothness Assumptions. J. Optim. Theory Appl. 196(3): 1008-1035 (2023) - 2022
- [j38]Andreas Fischer, Alain B. Zemkoho, Shenglong Zhou:
Semismooth Newton-type method for bilevel optimization: global convergence and extensive numerical experiments. Optim. Methods Softw. 37(5): 1770-1804 (2022) - 2021
- [j37]Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations. Comput. Optim. Appl. 78(1): 273-286 (2021) - [j36]Andreas Fischer, Alexey F. Izmailov, Mario Jelitte:
Newton-type methods near critical solutions of piecewise smooth nonlinear equations. Comput. Optim. Appl. 80(2): 587-615 (2021) - [j35]Muhammad Abid Dar, Andreas Fischer, John Martinovic, Guntram Scheithauer:
Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles. Discret. Optim. 40: 100623 (2021) - [j34]Franziska Theurich, Andreas Fischer, Guntram Scheithauer:
A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs. EURO J. Comput. Optim. 9: 100003 (2021) - [j33]Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
Unit stepsize for the Newton method close to critical solutions. Math. Program. 187(1): 697-721 (2021) - [c7]Petro Stetsyuk, Andreas Fischer, Oksana Pichugina:
A Penalty Approach to Linear Programs with Many Two-Sided Constraints. MOTOR 2021: 206-217 - 2020
- [j32]Andreas Fischer, Alexey F. Izmailov, Wladimir Scheck:
Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers. SIAM J. Optim. 30(2): 1555-1581 (2020)
2010 – 2019
- 2019
- [j31]John Martinovic, Markus Hähnel, Guntram Scheithauer, Waltenegus Dargie, Andreas Fischer:
Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation. 4OR 17(2): 173-200 (2019) - [j30]Andreas Fischer, Alexey F. Izmailov, Mikhail V. Solodov:
Local Attractors of Newton-Type Methods for Constrained Equations and Complementarity Problems with Nonisolated Solutions. J. Optim. Theory Appl. 180(1): 140-169 (2019) - 2018
- [j29]Andreas Fischer, Markus Herrich, Alexey F. Izmailov, Wladimir Scheck, Mikhail V. Solodov:
A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points. Comput. Optim. Appl. 69(2): 325-349 (2018) - [j28]Marcus Hähnel, John Martinovic, Guntram Scheithauer, Andreas Fischer, Alexander Schill, Waltenegus Dargie:
Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads. IEEE Trans. Parallel Distributed Syst. 29(11): 2478-2488 (2018) - [c6]Johannes Israel, Andreas Fischer, Meik Dorpinghaus:
On Wireless Board-to-Board Communication with Cascaded Butler Matrices. ISWCS 2018: 1-6 - 2017
- [j27]Carmo P. Brás, Andreas Fischer, Joaquim João Júdice, Klaus Schönefeld, Sarah Seifert:
A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem. Appl. Math. Comput. 294: 36-48 (2017) - [j26]John Martinovic, Eduard A. Jorswieck, Guntram Scheithauer, Andreas Fischer:
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation. IEEE Wirel. Commun. Lett. 6(4): 494-497 (2017) - [c5]Johannes Israel, Andreas Fischer:
Discrete worst-case SINR-maximization. ICUWB 2017: 1-5 - 2016
- [j25]Andreas Fischer, Markus Herrich, Alexey F. Izmailov, Mikhail V. Solodov:
Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions. Comput. Optim. Appl. 63(2): 425-459 (2016) - [j24]Andreas Fischer, Markus Herrich, Alexey F. Izmailov, Mikhail V. Solodov:
A Globally Convergent LP-Newton Method. SIAM J. Optim. 26(4): 2012-2033 (2016) - 2015
- [j23]Franziska Heinicke, Axel Simroth, Guntram Scheithauer, Andreas Fischer:
A railway maintenance scheduling problem with customer costs. EURO J. Transp. Logist. 4(1): 113-137 (2015) - [j22]Andreas Fischer, Gerd Langensiepen, Klaus Luig, Nico Strasdat, Thorsten Thies:
Efficient optimization of hyper-parameters for least squares support vector regression. Optim. Methods Softw. 30(6): 1095-1108 (2015) - [j21]Johannes Israel, Andreas Fischer, John Martinovic, Eduard A. Jorswieck, Marat Mesyagutov:
Discrete Receive Beamforming. IEEE Signal Process. Lett. 22(7): 958-962 (2015) - [c4]Johannes Israel, Andreas Fischer, John Martinovic:
A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds. ICUWB 2015: 1-5 - [c3]Michael Jenning, Bernhard Klein, Ronny Hahnel, Dirk Plettemeier, David Fritsche, Gregor Tretter, Corrado Carta, Frank Ellinger, Tobias Nardmann, Michael Schröter, Krzysztof Nieweglowski, Karlheinz Bock, Johannes Israel, Andreas Fischer, Najeeb ul Hassan, Lukas Landau, Meik Dorpinghaus, Gerhard P. Fettweis:
Energy-Efficient Transceivers for Ultra-Highspeed Computer Board-to-Board Communication. ICUWB 2015: 1-5 - 2014
- [j20]Roger Behling, Andreas Fischer, Markus Herrich, Alfredo N. Iusem, Yinyu Ye:
A Levenberg-Marquardt method with approximate projections. Comput. Optim. Appl. 59(1-2): 5-26 (2014) - [j19]Axel Dreves, Francisco Facchinei, Andreas Fischer, Markus Herrich:
A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application. Comput. Optim. Appl. 59(1-2): 63-84 (2014) - [j18]Francisco Facchinei, Andreas Fischer, Markus Herrich:
An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions. Math. Program. 146(1-2): 1-36 (2014) - 2013
- [j17]Francisco Facchinei, Andreas Fischer, Markus Herrich:
A family of Newton methods for nonsmooth constrained systems with nonisolated solutions. Math. Methods Oper. Res. 77(3): 433-443 (2013) - [c2]Johannes Israel, John Martinovic, Andreas Fischer, Michael Jenning, Lukas Landau:
Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network. WSA 2013: 1-7 - 2012
- [j16]Carl Brunner, Andreas Fischer, Klaus Luig, Thorsten Thies:
Pairwise support vector machines and their application to large scale problems. J. Mach. Learn. Res. 13: 2279-2292 (2012) - [j15]Roger Behling, Andreas Fischer:
A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods. Optim. Lett. 6(5): 927-940 (2012) - 2010
- [j14]Andreas Fischer, Ana Friedlander:
A new line search inexact restoration approach for nonlinear programming. Comput. Optim. Appl. 46(2): 333-346 (2010)
2000 – 2009
- 2009
- [j13]Francisco Facchinei, Andreas Fischer, Veronica Piccialli:
Generalized Nash equilibrium problems and Newton methods. Math. Program. 117(1-2): 163-194 (2009) - 2008
- [j12]Andreas Fischer, Pradyumn Kumar Shukla:
A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization. Oper. Res. Lett. 36(5): 643-646 (2008) - [c1]Fred Richter, Andreas Fischer, René Habendorf, Gerhard P. Fettweis:
Transmitter-Based Minimization of Error Rates in the Downlink of Wireless Systems. GLOBECOM 2008: 3433-3437 - 2007
- [j11]Francisco Facchinei, Andreas Fischer, Veronica Piccialli:
On generalized Nash games and variational inequalities. Oper. Res. Lett. 35(2): 159-164 (2007) - 2002
- [j10]Andreas Fischer:
Local behavior of an iterative framework for generalized equations with nonisolated solutions. Math. Program. 94(1): 91-124 (2002) - 2001
- [j9]Todd S. Munson, Francisco Facchinei, Michael C. Ferris, Andreas Fischer, Christian Kanzow:
The Semismooth Algorithm for Large Scale Complementarity Problems. INFORMS J. Comput. 13(4): 294-311 (2001) - 2000
- [j8]Andreas Fischer, Houyuan Jiang:
Merit Functions for Complementarity and Related Problems: A Survey. Comput. Optim. Appl. 17(2-3): 159-182 (2000) - [j7]Francisco Facchinei, Andreas Fischer, Christian Kanzow:
On the Identification of Zero Variables in an Interior-Point Framework. SIAM J. Optim. 10(4): 1058-1078 (2000)
1990 – 1999
- 1999
- [j6]Andreas Fischer:
Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers. Math. Oper. Res. 24(3): 699-727 (1999) - 1998
- [j5]Luís M. Fernandes, Andreas Fischer, Joaquim Júdice, Cristina Requejo, João Soares:
A block active set algorithm for large-scalequadratic programming with box constraints. Ann. Oper. Res. 81: 75-96 (1998) - [j4]Francisco Facchinei, Andreas Fischer, Christian Kanzow:
Regularity Properties of a Semismooth Reformulation of Variational Inequalities. SIAM J. Optim. 8(3): 850-869 (1998) - [j3]Francisco Facchinei, Andreas Fischer, Christian Kanzow:
On the Accurate Identification of Active Constraints. SIAM J. Optim. 9(1): 14-32 (1998) - 1996
- [j2]Andreas Fischer, Christian Kanzow:
On finite termination of an iterative method for linear complementarity problems. Math. Program. 74: 279-292 (1996) - [j1]Andreas Fischer:
Solution of monotone complementarity problems with locally Lipschitzian functions. Math. Program. 76: 513-532 (1996)
1980 – 1989
- 1987
- [b1]Andreas Fischer:
Optimierungsverfahren mit speziellen explizit auflösbaren Teilproblemen, ihre Globalisierung durch Dämpfung und überlineare Konvergenz. Dresden University of Technology, Germany, 1987
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-10-31 20:14 CET 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:
