Andrew C. Eberhard

Orcid: 0000-0003-2977-3456

According to our database1, Andrew C. Eberhard authored at least 32 papers between 2000 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
A study of progressive hedging for stochastic integer programming.
Comput. Optim. Appl., December, 2023

A Version of Bundle Trust Region Method with Linear Programming.
J. Optim. Theory Appl., November, 2023

Convergences for robust bilevel polynomial programmes with applications.
Optim. Methods Softw., September, 2023

Fixed-Time Gradient Dynamics With Time-Varying Coefficients for Continuous-Time Optimization.
IEEE Trans. Autom. Control., July, 2023

Adaptive solution prediction for combinatorial optimization.
Eur. J. Oper. Res., 2023

Batch Level Distributed Training of LSTM with Infinity Norm Gradient Flow.
Proceedings of the Databases Theory and Applications, 2023

2022
The p-Lagrangian relaxation for separable nonconvex MIQCQP problems.
J. Glob. Optim., 2022

Impact of Mathematical Norms on Convergence of Gradient Descent Algorithms for Deep Neural Networks Learning.
Proceedings of the AI 2022: Advances in Artificial Intelligence, 2022

Enhancing Column Generation by a Machine-Learning-Based Pricing Heuristic for Graph Coloring.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Performance comparison of feature selection and extraction methods with random instance selection.
Expert Syst. Appl., 2021

Convergence rates for boundedly regular systems.
Adv. Comput. Math., 2021

Learning Primal Heuristics for Mixed Integer Programs.
Proceedings of the International Joint Conference on Neural Networks, 2021

2020
Explicit Formula for Preimages of Relaxed One-Sided Lipschitz Mappings with Negative Lipschitz Constants: A Geometric Approach.
J. Optim. Theory Appl., 2020

Combining penalty-based and Gauss-Seidel methods for solving stochastic mixed-integer problems.
Int. Trans. Oper. Res., 2020

2019
Bi-objective integer programming analysis based on the characteristic equation.
Int. J. Syst. Assur. Eng. Manag., 2019

On partial smoothness, tilt stability and the VU -decomposition.
Math. Program., 2019

A parallelizable augmented Lagrangian method applied to large-scale non-convex-constrained optimization problems.
Math. Program., 2019

Enhancing the normalized multiparametric disaggregation technique for mixed-integer quadratic programming.
J. Glob. Optim., 2019

2018
Combining Progressive Hedging with a Frank-Wolfe Method to Compute Lagrangian Dual Bounds in Stochastic Mixed-Integer Programming.
SIAM J. Optim., 2018

On the volatility of blood inventories.
Int. Trans. Oper. Res., 2018

2016
(Convex) Level Sets Integration.
J. Optim. Theory Appl., 2016

2015
On the augmented Lagrangian dual for integer programming.
Math. Program., 2015

A Trust Region Method for the Solution of the Surrogate Dual in Integer Programming.
J. Optim. Theory Appl., 2015

2014
Boosting the feasibility pump.
Math. Program. Comput., 2014

2013
Maximal quasimonotonicity and dense single-directional properties of quasimonotone operators.
Math. Program., 2013

2012
A New Approach to the Feasibility Pump in Mixed Integer Programming.
SIAM J. Optim., 2012

2010
A geometrical insight on pseudoconvexity and pseudomonotonicity.
Math. Program., 2010

2009
Some Sufficient Optimality Conditions in Nonsmooth Analysis.
SIAM J. Optim., 2009

2006
A Numerical Method for a Class of Mixed Switching and Impulsive Optimal Control Problems.
Comput. Math. Appl., 2006

2005
Control System for Optimal Flight Trajectories for Terrain Collision Avoidance.
Proceedings of the Knowledge-Based Intelligent Information and Engineering Systems, 2005

2002
Fundamental limitations on the time-domain shaping of response to a fixed input.
IEEE Trans. Autom. Control., 2002

2000
Comments on "Controller design with multiple objectives".
IEEE Trans. Autom. Control., 2000


  Loading...