Search Results - "Scheinberg, K."
-
1
Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
Published in Mathematical programming (01-06-2018)“…We present global convergence rates for a line-search method which is based on random first-order models and directions whose quality is ensured only with…”
Get full text
Journal Article -
2
Stochastic optimization using a trust-region method and random models
Published in Mathematical programming (01-06-2018)“…In this paper, we propose and analyze a trust-region model-based algorithm for solving unconstrained stochastic optimization problems. Our framework utilizes…”
Get full text
Journal Article -
3
Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization
Published in Mathematical programming (01-08-2012)“…Interpolation-based trust-region methods are an important class of algorithms for Derivative-Free Optimization which rely on locally approximating an objective…”
Get full text
Journal Article Conference Proceeding -
4
Geometry of interpolation sets in derivative free optimization
Published in Mathematical programming (01-01-2008)“…We consider derivative free methods based on sampling approaches for nonlinear optimization problems where derivatives of the objective function are not…”
Get full text
Journal Article Conference Proceeding -
5
Product-form Cholesky factorization in interior point methods for second-order cone programming
Published in Mathematical programming (01-05-2005)“…Second-order cone programming (SOCP) problems are typically solved by interior point methods. As in linear programming (LP), interior point methods can, in…”
Get full text
Journal Article -
6
Recent progress in unconstrained nonlinear optimization without derivatives
Published in Mathematical programming (01-10-1997)Get full text
Conference Proceeding Journal Article -
7
Numerically stable LDLT factorizations in interior point methods for convex quadratic programming
Published in IMA journal of numerical analysis (01-10-2008)“…Fletcher & Powell (1974, Math. Comput., 28, 1067–1087) proposed a numerically stable method for updating the LDLT factorization of a symmetric…”
Get full text
Journal Article -
8
A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
Published in Mathematical programming (2004)“…Cholesky factorization has become the method of choice for solving the symmetric system of linear equations arising in interior point methods (IPMs) for linear…”
Get full text
Journal Article -
9
Sparse Modeling in fMRI Analysis
Published in NeuroImage (Orlando, Fla.) (01-07-2009)“…[...]we address the problem of learning interactions among voxels in the form of probabilistic graphical models, such as Markov networks (or Markov Random…”
Get full text
Journal Article -
10
On parametric semidefinite programming
Published in Applied numerical mathematics (01-03-1999)“…In this paper we consider a semidefinite programming (SDP) problem in which the objective function depends linearly on a scalar parameter. We study the…”
Get full text
Journal Article Conference Proceeding -
11
A Modified Barrier-Augmented Lagrangian Method for Constrained Minimization
Published in Computational optimization and applications (01-07-1999)“…We present and analyze an interior-exterior augmented Lagrangian method for solving constrained optimization problems with both inequality and equality…”
Get full text
Journal Article -
12
Comparison of QTc Interval Prolongation for Patients in Methadone Versus Buprenorphine Maintenance Treatment: A 5-Year Follow-Up
Published in Journal of addictive diseases (01-07-2013)“…The authors investigated whether patients receiving buprenorphine maintenance treatment (BMT) will have corrected QT (QTc) prolongation after taking…”
Get full text
Journal Article -
13
Numerically stable LDL[sup]T factorizations in interior point methods for convex quadratic programming
Published in IMA journal of numerical analysis (01-10-2008)“…Fletcher & Powell (1974, Math. Comput., 28, 1067-1087) proposed a numerically stable method for updating the LDL[sup]T factorization of a symmetric…”
Get full text
Journal Article -
14
Geometry of sample sets in derivative-free optimization: polynomial regression and underdetermined interpolation
Published in IMA journal of numerical analysis (01-10-2008)“…In recent years there has been a considerable amount of work on the development of numerical methods for derivative-free optimization problems. Some of this…”
Get full text
Journal Article -
15
Map approach to learning sparse Gaussian Markov networks
Published in 2009 IEEE International Conference on Acoustics, Speech and Signal Processing (01-04-2009)“…Recently proposed l 1 -regularized maximum-likelihood optimization methods for learning sparse Markov networks result into convex problems that can be solved…”
Get full text
Conference Proceeding -
16
Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
Published in Mathematical programming (31-03-1996)Get full text
Journal Article -
17
Detecting Generic Visual Eventswith Temporal Cues
Published in 2006 Fortieth Asilomar Conference on Signals, Systems and Computers (01-10-2006)“…We present novel algorithms for detecting generic visual events from video. Target event models will produce binary decisions on each shot about classes of…”
Get full text
Conference Proceeding -
18
Aligning ligand binding cavities by optimizing superposed volume
Published in 2012 IEEE International Conference on Bioinformatics and Biomedicine (01-10-2012)“…We describe an optimization-based method that seeks the superposition of ligand binding cavities that maximizes their overlapping volume. Our method, called…”
Get full text
Conference Proceeding