The following pages link to James V. Burke (Q185373):
Displaying 50 items.
- (Q239247) (redirect page) (← links)
- Gradient consistency for integral-convolution smoothing functions (Q491234) (← links)
- Epi-convergence properties of smoothing by infimal convolution (Q526386) (← links)
- On the subdifferential regularity of max root functions for polynomials (Q654060) (← links)
- Optimality conditions for non-finite valued convex composite functions (Q687377) (← links)
- Characterizations of the polynomial numerical hull of degree \(k\) (Q854852) (← links)
- Convergence properties of trust region methods for linear and convex constraints (Q922951) (← links)
- Weak sharp minima revisited. III: Error bounds for differentiable convex inclusions (Q959926) (← links)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
- Weak directional closedness and generalized subdifferentials (Q1176585) (← links)
- Stable perturbations of nonsymmetric matrices (Q1188440) (← links)
- On the Clarke subdifferential of the distance function of a closed set (Q1191783) (← links)
- A relative weighting method for estimating parameters and variances in multiple data sets (Q1350410) (← links)
- (Q1591361) (redirect page) (← links)
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating (Q1591362) (← links)
- Two numerical methods for optimizing matrix stability (Q1611899) (← links)
- Generalized Kalman smoothing: modeling and algorithms (Q1678609) (← links)
- Level-set methods for convex optimization (Q1739042) (← links)
- A polynomial time interior-point path-following algorithm for LCP based on Chen-Harker-Kanzow smoothing techniques (Q1806026) (← links)
- A Gauss-Newton method for convex composite optimization (Q1914073) (← links)
- The subdifferential of measurable composite max integrands and smoothing approximation (Q2189440) (← links)
- Fast robust methods for singular state-space models (Q2280717) (← links)
- Variational analysis of convexly generated spectral max functions (Q2413081) (← links)
- Variational analysis of the abscissa mapping for polynomials via the Gauss-Lucas theorem (Q2574760) (← links)
- Weak sharp minima revisited. II: Application to linear regularity and error bounds (Q2576722) (← links)
- Variational analysis of functions of the roots of polynomials (Q2576723) (← links)
- Characterization of solution sets of convex programs (Q2640443) (← links)
- A sequential quadratic programming method for potentially infeasible mathematical programs (Q2640450) (← links)
- Spectral conditioning and pseudospectral growth (Q2642284) (← links)
- Variational Analysis of the Abscissa Mapping for Polynomials (Q2706169) (← links)
- Optimizing matrix stability (Q2706575) (← links)
- (Q2710347) (← links)
- (Q2710355) (← links)
- (Q2743983) (← links)
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems (Q2757562) (← links)
- Epi-convergent Smoothing with Applications to Convex Composite Functions (Q2866193) (← links)
- Variational Properties of Value Functions (Q2866203) (← links)
- Sparse/Robust Estimation and Kalman Smoothing with Nonsmooth Log-Concave Densities: Modeling, Computation, and Theory (Q2933910) (← links)
- (Q2933984) (← links)
- Iterative Reweighted Linear Least Squares for Exact Penalty Subproblems on Product Sets (Q2954385) (← links)
- Weak Sharp Minima in Mathematical Programming (Q3141558) (← links)
- A Sequential Quadratic Optimization Algorithm with Rapid Infeasibility Detection (Q3192106) (← links)
- Inexact Sequential Quadratic Optimization with Penalty Parameter Updates within the QP Solver (Q3300768) (← links)
- Calmness and Exact Penalization (Q3363074) (← links)
- Strong Metric (Sub)regularity of Karush–Kuhn–Tucker Mappings for Piecewise Linear-Quadratic Convex-Composite Optimization and the Quadratic Convergence of Newton’s Method (Q3387919) (← links)
- (Q3528771) (← links)
- The Speed of Shor's R-algorithm (Q3543417) (← links)
- Descent methods for composite nondifferentiable optimization problems (Q3705231) (← links)
- Second order necessary and sufficient conditions for convex composite NDO (Q3782317) (← links)
- On the Identification of Active Constraints (Q3813207) (← links)
