Andreas Fischer

Affiliations:
  • Technical University of Dresden, Institute for Numerical Mathematics, Germany
  • University of Dortmund, Germany


According to our database1, Andreas Fischer authored at least 45 papers between 1987 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Unit stepsize for the Newton method close to critical solutions.
Math. Program., 2021

A branch-and-bound approach for a Vehicle Routing Problem with Customer Costs.
EURO J. Comput. Optim., 2021

Integer linear programming formulations for the minimum connectivity inference problem and model reduction principles.
Discret. Optim., 2021

Accelerating convergence of the globalized Newton method to critical solutions of nonlinear equations.
Comput. Optim. Appl., 2021

Newton-type methods near critical solutions of piecewise smooth nonlinear equations.
Comput. Optim. Appl., 2021

A Penalty Approach to Linear Programs with Many Two-Sided Constraints.
Proceedings of the Mathematical Optimization Theory and Operations Research, 2021

2020
Adjusting Dual Iterates in the Presence of Critical Lagrange Multipliers.
SIAM J. Optim., 2020

2019
Local Attractors of Newton-Type Methods for Constrained Equations and Complementarity Problems with Nonisolated Solutions.
J. Optim. Theory Appl., 2019

Cutting stock problems with nondeterministic item lengths: a new approach to server consolidation.
4OR, 2019

2018
Extending the Cutting Stock Problem for Consolidating Services with Stochastic Workloads.
IEEE Trans. Parallel Distributed Syst., 2018

A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points.
Comput. Optim. Appl., 2018

On Wireless Board-to-Board Communication with Cascaded Butler Matrices.
Proceedings of the 15th International Symposium on Wireless Communication Systems, 2018

2017
Integer Linear Programming Formulations for Cognitive Radio Resource Allocation.
IEEE Wirel. Commun. Lett., 2017

A block active set algorithm with spectral choice line search for the symmetric eigenvalue complementarity problem.
Appl. Math. Comput., 2017

Discrete worst-case SINR-maximization.
Proceedings of the 17th IEEE International Conference on Ubiquitous Wireless Broadband, 2017

2016
A Globally Convergent LP-Newton Method.
SIAM J. Optim., 2016

Convergence conditions for Newton-type methods applied to complementarity systems with nonisolated solutions.
Comput. Optim. Appl., 2016

2015
Discrete Receive Beamforming.
IEEE Signal Process. Lett., 2015

Efficient optimization of hyper-parameters for least squares support vector regression.
Optim. Methods Softw., 2015

A railway maintenance scheduling problem with customer costs.
EURO J. Transp. Logist., 2015

Energy-Efficient Transceivers for Ultra-Highspeed Computer Board-to-Board Communication.
Proceedings of the IEEE International Conference on Ubiquitous Wireless Broadband, 2015

A Branch-and-Bound Algorithm for Discrete Receive Beamforming with Improved Bounds.
Proceedings of the IEEE International Conference on Ubiquitous Wireless Broadband, 2015

2014
An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions.
Math. Program., 2014

A new error bound result for Generalized Nash Equilibrium Problems and its algorithmic application.
Comput. Optim. Appl., 2014

A Levenberg-Marquardt method with approximate projections.
Comput. Optim. Appl., 2014

2013
A family of Newton methods for nonsmooth constrained systems with nonisolated solutions.
Math. Methods Oper. Res., 2013

Optimal Antenna Positioning for Wireless Board-To-Board Communication Using a Butler Matrix Beamforming Network.
Proceedings of the 17th International ITG Workshop on Smart Antennas, 2013

2012
A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods.
Optim. Lett., 2012

Pairwise support vector machines and their application to large scale problems.
J. Mach. Learn. Res., 2012

2010
A new line search inexact restoration approach for nonlinear programming.
Comput. Optim. Appl., 2010

2009
Generalized Nash equilibrium problems and Newton methods.
Math. Program., 2009

2008
A Levenberg-Marquardt algorithm for unconstrained multicriteria optimization.
Oper. Res. Lett., 2008

Transmitter-Based Minimization of Error Rates in the Downlink of Wireless Systems.
Proceedings of the Global Communications Conference, 2008. GLOBECOM 2008, New Orleans, LA, USA, 30 November, 2008

2007
On generalized Nash games and variational inequalities.
Oper. Res. Lett., 2007

2002
Local behavior of an iterative framework for generalized equations with nonisolated solutions.
Math. Program., 2002

2001
The Semismooth Algorithm for Large Scale Complementarity Problems.
INFORMS J. Comput., 2001

2000
On the Identification of Zero Variables in an Interior-Point Framework.
SIAM J. Optim., 2000

Merit Functions for Complementarity and Related Problems: A Survey.
Comput. Optim. Appl., 2000

1999
Modified Wilson's Method for Nonlinear Programs with Nonunique Multipliers.
Math. Oper. Res., 1999

1998
Regularity Properties of a Semismooth Reformulation of Variational Inequalities.
SIAM J. Optim., 1998

On the Accurate Identification of Active Constraints.
SIAM J. Optim., 1998

A block active set algorithm for large-scalequadratic programming with box constraints.
Ann. Oper. Res., 1998

1996
On finite termination of an iterative method for linear complementarity problems.
Math. Program., 1996

Solution of monotone complementarity problems with locally Lipschitzian functions.
Math. Program., 1996

1987
Optimierungsverfahren mit speziellen explizit auflösbaren Teilproblemen, ihre Globalisierung durch Dämpfung und überlineare Konvergenz.
PhD thesis, 1987


  Loading...