Results 1  10
of
24
A trust region method based on interior point techniques for nonlinear programming
 Mathematical Programming
, 1996
"... Jorge Nocedal z An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described. It applies sequential quadratic programming techniques to a sequence of barrier problems, and uses trust regions to ensure the robustness of the iteration and to allow the direc ..."
Abstract

Cited by 103 (17 self)
 Add to MetaCart
Jorge Nocedal z An algorithm for minimizing a nonlinear function subject to nonlinear inequality constraints is described. It applies sequential quadratic programming techniques to a sequence of barrier problems, and uses trust regions to ensure the robustness of the iteration and to allow the direct use of second order derivatives. This framework permits primal and primaldual steps, but the paper focuses on the primal version of the new algorithm. An analysis of the convergence properties of this method is presented. Key words: constrained optimization, interior point method, largescale optimization, nonlinear programming, primal method, primaldual method, SQP iteration, barrier method, trust region method.
Improving the Numerical Performance of BLP Static and Dynamic Discrete Choice Random Coefficients Demand Estimation
, 2008
"... The widelyused estimator of Berry, Levinsohn and Pakes (1995) produces consistent instrumental variables estimates of consumer preferences from a discretechoice demand model with random coefficients, marketlevel demand shocks and potentially endogenous regressors (prices). The nested fixedpoint ..."
Abstract

Cited by 21 (0 self)
 Add to MetaCart
The widelyused estimator of Berry, Levinsohn and Pakes (1995) produces consistent instrumental variables estimates of consumer preferences from a discretechoice demand model with random coefficients, marketlevel demand shocks and potentially endogenous regressors (prices). The nested fixedpoint algorithm typically used for estimation is computationally intensive, largely because a system of market share equations must be repeatedly numerically inverted. We provide numerical theory results that characterize the properties of typical nested fixedpoint implementations. We use these results to discuss several problems with typical computational implementations and, in particular, cases which can lead to incorrect parameter estimates. As a solution, we introduce a new computational formulation of the estimator that recasts estimation as a mathematical program with equilibrium constraints (MPEC). In many instances, MPEC is faster than the nested fixed point approach. It also avoids the numerical issues associated with nested inner loops. Several Monte Carlo experiments support our numerical concerns about NFP and the advantages of MPEC. We also discuss estimating static BLP using maximum likelihood instead of GMM. Finally, we show that MPEC is particularly attractive for forwardlooking demand models where
Mesh ShapeQuality Optimization Using the Inverse MeanRatio Metric
 Preprint ANL/MCSP11360304, Argonne National Laboratory, Argonne
, 2004
"... Meshes containing elements with bad quality can result in poorly conditioned systems of equations that must be solved when using a discretization method, such as the finiteelement method, for solving a partial differential equation. Moreover, such meshes can lead to poor accuracy in the approximate ..."
Abstract

Cited by 14 (4 self)
 Add to MetaCart
Meshes containing elements with bad quality can result in poorly conditioned systems of equations that must be solved when using a discretization method, such as the finiteelement method, for solving a partial differential equation. Moreover, such meshes can lead to poor accuracy in the approximate solution computed. In this paper, we present a nonlinear fractional program that relocates the vertices of a given mesh to optimize the average element shape quality as measured by the inverse meanratio metric. To solve the resulting largescale optimization problems, we apply an efficient implementation of an inexact Newton algorithm using the conjugate gradient method with a block Jacobi preconditioner to compute the direction. We show that the block Jacobi preconditioner is positive definite by proving a general theorem concerning the convexity of fractional functions, applying this result to components of the inverse meanratio metric, and showing that each block in the preconditioner is invertible. Numerical results obtained with this specialpurpose code on several test meshes are presented and used to quantify the impact on solution time and memory requirements of using a modeling language and generalpurpose algorithm to solve these problems. 1
Portfolio selection with robust estimation of risk
, 2006
"... Meanvariance portfolios constructed using the sample mean and covariance matrix of asset returns perform poorly due to estimation error. Moreover, it is commonly accepted that estimation error in the sample mean is much larger than in the sample covariance matrix. For this reason, recent research h ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Meanvariance portfolios constructed using the sample mean and covariance matrix of asset returns perform poorly due to estimation error. Moreover, it is commonly accepted that estimation error in the sample mean is much larger than in the sample covariance matrix. For this reason, recent research has focused on the minimumvariance portfolio, which relies only on estimates of the covariance matrix and thus usually performs better outofsample. But even minimumvariance portfolios are quite sensitive to estimation error and have unstable weights that fluctuate substantially over time. Jagannathan and Ma (2003) show that imposing shortselling constraints can help alleviate this difficulty. In this paper, we propose a class of portfolio policies that have better stability properties than the traditional minimumvariance portfolio. The proposed policies are based on certain robust estimators of risk and can be computed by solving a single nonlinear program, where estimation and portfolio optimization are performed in one step. We show analytically that the portfolio weights of the resulting policies are less sensitive to changes in the distributional assumptions than those of the traditional minimumvariance policy. Moreover, our numerical results on simulated and empirical data confirm that the proposed policies are more stable (even in the presence of constraints) and that they preserve (or slightly improve) the already relatively high outofsample Sharpe ratio of the minimumvariance policy.
Constrained Minimum Crest Factor Multisine Signals for "PlantFriendly" Identification of Highly Interactive Systems
 In: 13th IFAC Symp. on System Identification. Rotterdam
, 2003
"... Highly interactive systems are illconditioned and highly sensitive to model uncertainty, which imposes limitations to achievable closedloop performance. In this paper, the goal is to develop an identification testing framework meaningful to highly interactive systems based on the application of ..."
Abstract

Cited by 7 (5 self)
 Add to MetaCart
Highly interactive systems are illconditioned and highly sensitive to model uncertainty, which imposes limitations to achievable closedloop performance. In this paper, the goal is to develop an identification testing framework meaningful to highly interactive systems based on the application of constrained minimum crest factor multisine signals.
An interiorpoint method for MPECs based on strictly feasible relaxations
 Preprint ANL/MCSP11500404, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL
, 2004
"... Abstract. An interiorpoint method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence. Each subproblem is defined as a relaxation of the MPEC with a nonempty ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
Abstract. An interiorpoint method for solving mathematical programs with equilibrium constraints (MPECs) is proposed. At each iteration of the algorithm, a single primaldual step is computed from each subproblem of a sequence. Each subproblem is defined as a relaxation of the MPEC with a nonempty strictly feasible region. In contrast to previous approaches, the proposed relaxation scheme preserves the nonempty strict feasibility of each subproblem even in the limit. Local and superlinear convergence of the algorithm is proved even with a less restrictive strict complementarity condition than the standard one. Moreover, mechanisms for inducing global convergence in practice are proposed. Numerical results on the MacMPEC test problem set demonstrate the fastlocal convergence properties of the algorithm. Key words. nonlinear programming, mathematical programs with equilibrium constraints, constrained minimization, interiorpoint methods, primaldual methods, barrier methods
Fuzzy Trust Integration for Security Enforcement in Grid Computing
 in Proceedings of IFIP International Conf. on Network and Parallel Computing, (NPC2004
, 2004
"... Abstract. How to build the mutual trust among Grid resources sites is crucial to secure distributed Grid applications. We suggest enhancing the trust index of resource sites by upgrading their intrusion defense capabilities and checking the success rate of jobs running on the platforms. We propose a ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
Abstract. How to build the mutual trust among Grid resources sites is crucial to secure distributed Grid applications. We suggest enhancing the trust index of resource sites by upgrading their intrusion defense capabilities and checking the success rate of jobs running on the platforms. We propose a new fuzzylogic trust model for securing Grid resources. Grid security is enforced through trust update, propagation, and integration across sites. Fuzzy trust integration reduces platform vulnerability and guides the defense deployment across Grid sites. We developed a SeGO scheduler for trusted Grid resource allocation. The SeGO scheduler optimizes the aggregate computing power with security assurance under fixed budget constraints. The effectiveness of the scheme was verified by simulation experiments. Our results show up to 90% enhancement in site security. Compared with no trust integration, our scheme leads to 114 % improvement in Grid performance/cost ratio. The job drop rate reduces by 75%. The utilization of Grid resources increased to 92.6 % as more jobs are submitted. These results demonstrate significant performance gains through optimized resource allocation and aggressive security reinforcement. 1.
OptimizationBased Design of PlantFriendly Input Signals Using Geometric Discrepancy Criteria
 14 th IFAC Symposium on System Identification (SYSID 2006
, 2006
"... Abstract: The design of constrained, “plantfriendly ” multisine input signals that optimize a geometric discrepancy criterion arising from Weyl’s Theorem is examined in this paper. Such signals are meaningful for datacentric estimation methods, where uniform coverage of the output statespace is c ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
Abstract: The design of constrained, “plantfriendly ” multisine input signals that optimize a geometric discrepancy criterion arising from Weyl’s Theorem is examined in this paper. Such signals are meaningful for datacentric estimation methods, where uniform coverage of the output statespace is critical. The usefulness of this problem formulation is demonstrated by applying it to a linear example and to the nonlinear, highly interactive distillation column model developed by Weischedel and McAvoy (1980). The optimization problem includes a search for both the Fourier coefficients and phases in the multisine signal, resulting in an uniformly distributed output signal displaying a desirable balance between high and low gain directions. The solution involves very little user intervention (which enhances its practical usefulness) and has significant benefits compared to multisine signals that minimize crest factor.
Trusted grid computing with security assurance and resource optimization
 In Proc. 17th International Conference on Parallel and Distributed Computing Systems (PDCS2004
, 2004
"... The security of Grid sites can be enhanced by upgrading its intrusion defense capabilities against its previous job success rate on Grid platforms. A new fuzzylogic trust model is proposed for distributed security enforcement across multiple Grid resources sites. The design is aimed at securing Grid ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The security of Grid sites can be enhanced by upgrading its intrusion defense capabilities against its previous job success rate on Grid platforms. A new fuzzylogic trust model is proposed for distributed security enforcement across multiple Grid resources sites. The design is aimed at securing Grid resources with optimized resources subject to budget constraints. The performance of trusted Grid computing is verified by simulated trust integration over multiple Grid resource sites. The SARAH scheme scales well with increasing number of divisible user jobs and can sustain high efficiency, as more resource sites are added. Integrated trust and resource optimization make it possible to accommodate all user applications with low job drops and short waiting time. As a result, the Grid resources are better utilized for distributed execution of large number of user jobs.
Effective reformulations of the truss topology design problem
 Optimization and Engineering
, 2006
"... problem ..."