搜索结果: 1-11 共查到“计算数学 Optimization”相关记录11条 . 查询时间(0.103 秒)
Many real world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. These problems are frequently characterized by non-convex, non-different...
Many real world problems arising in engineering, economics, medicine and other domains can be formulated as optimization tasks. These problems are frequently characterized by non-convex, non-different...
Antenna array pattern synthesis via convex optimization
Antenna array model numerical geometric shape elements value
2015/8/11
We show that a variety of antenna array pattern synthesis problems can be expressed as convex optimization problems, which can be (numerically) solved with great efficiency by recently developed inter...
Face Recognition from Incomplete Measurements via l1-Optimization
Sparse Representation l1Minimization Face Recognition Sparse Recovery Interior Point Methods Sparse Regularization
2013/1/30
In this work, we consider a homotopic principle for solving large-scale and dense l1underdetermined problems and its applications in image processing and classification. We solve the face recognition ...
First Order Convergence Analysis for Sparse Grid Method in Stochastic Two-Stage Linear Optimization Problem
Convergence Analysis Stochastic Optimization Scenario Generation Convex Analysis Measure Theory
2013/1/30
Stochastic two-stage linear optimization is an important and widely used optimization model. Efficiency of numerical integration of the second stage value function is critical. However, the second sta...
Computational Optimization of Manufacturing Batch Size and Shipment for an Integrated EPQ Model with Scrap
Computational Optimization Manufacturing Batch Size Shipments, EPQ Model Random Scrap Rate Algebraic Approach
2013/1/30
This paper employs mathematical modeling and algebraic approach to derive the optimal manufacturing batch size and number of shipment for a vendor-buyer integrated economic production quantity (EPQ) m...
On the computational complexity of stochastic controller optimization in POMDPs
Partially observable Markov decision process stochastic controller bilinear program computational complexity Motzkin-Straus theorem
2011/10/8
Abstract: We show that the problem of finding an optimal stochastic 'blind' controller in a Markov decision process is an NP-hard problem. The corresponding decision problem is NP-hard, in PSPACE, and...
AN SQP ALGORITHM WITH NONMONOTONE LINE SEARCH FOR GENERAL NONLINEARCONSTRAINED OPTIMIZATION PROBLEM
2007/12/11
In this paper, an SQP type algorithm with a new nonmonotone line search
technique for general constrained optimization problems is presented.
The new algorithm does not have to solve the second orde...
A new algorithm for unconstrained optimization is developed, by using the product form of the OCSSR1 update. The implementation is especially useful when gradient information is estimated by dmerence ...
The Global Convergence of Self-scale BFGS Algorithm with Nonmonotone Line Search for Unconstrained Nonconvex Optimization Problems
nonmonotone line search self-scaling BFGS method global convergence
2007/12/11
The self-scaling quasi-Newton method solves an unconstrained optimization problem by scaling the Hessian approximation matrix before it is updated at each iteration to avoid the possible large eigenva...
Journal of Computational Mathematics and Optimization
computational mathematics numerical analysis number theory 计算数学
2007/12/25
The Journal of Computational Mathematics and Optimization is a refereed mathematical journal published in one volume of three issues annually devoted to publish original research papers/survey article...