Michael Kupferschmid

According to our database, Michael Kupferschmid authored at least 8 papers between 1983 and 2013.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2013

Solving nonlinear principal-agent problems using bilevel programming.

Mark Cecchini, Joseph G. Ecker, Michael Kupferschmid, Robert Leitch

Eur. J. Oper. Res., 2013

2004

Active set strategies in an ellipsoid algorithm for nonlinear programming.

Edgar K. Rugenstein, Michael Kupferschmid

Comput. Oper. Res., 2004

2002

An application of nonlinear optimization in molecular biology.

Joseph G. Ecker, Michael Kupferschmid, C. E. Lawrence, A. A. Reilly, A. C. H. Scott

Eur. J. Oper. Res., 2002

2000

An ellipsoid algorithm for equality-constrained nonlinear programs.

Sharmila Shah, John E. Mitchell, Michael Kupferschmid

Comput. Oper. Res., 2000

1998

Numerical Verification of Second-Order Sufficiency Conditions for Nonlinear Programming.

Terrence K. Kelly, Michael Kupferschmid

SIAM Rev., 1998

1994

Performance of Several Optimization Methods on Robot Trajectory Planning Problems.

Joseph G. Ecker, Michael Kupferschmid, Samuel P. Marin

SIAM J. Sci. Comput., 1994

1989

A numerical investigation of rank-two ellipsoid algorithms for nonlinear programming.

Ahmed Ech-Cherif, Joseph G. Ecker, Michael Kupferschmid

Math. Program., 1989

1983

An ellipsoid algorithm for nonlinear programming.

Joseph G. Ecker, Michael Kupferschmid

Math. Program., 1983