• Title/Summary/Keyword: local minimization

Search Result 128, Processing Time 0.027 seconds

Finite Element Analysis and Local a Posteriori Error Estimates for Problems of Flow through Porous Media (다공매체를 통과하는 유동문제의 유한요소해석과 부분해석후 오차계산)

  • Lee, Choon-Yeol
    • Transactions of the Korean Society of Mechanical Engineers A
    • /
    • v.21 no.5
    • /
    • pp.850-858
    • /
    • 1997
  • A new a posteriori error estimator is introduced and applied to variational inequalities occurring in problems of flow through porous media. In order to construct element-wise a posteriori error estimates the global error is localized by a special mixed formulation in which continuity conditions at interfaces are treated as constraints. This approach leads to error indicators which provide rigorous upper bounds of the element errors. A discussion of a compatibility condition for the well-posedness of the local error analysis problem is given. Two numerical examples are solved to check the compatibility of the local problems and convergence of the effectivity index both in a local and a global sense with respect to local refinements.

A NOVEL FILLED FUNCTION METHOD FOR GLOBAL OPTIMIZATION

  • Lin, Youjiang;Yang, Yongjian;Zhang, Liansheng
    • Journal of the Korean Mathematical Society
    • /
    • v.47 no.6
    • /
    • pp.1253-1267
    • /
    • 2010
  • This paper considers the unconstrained global optimization with the revised filled function methods. The minimization sequence could leave from a local minimizer to a better minimizer of the objective function through minimizing an auxiliary function constructed at the local minimizer. Some promising numerical results are also included.

AN EXACT LOGARITHMIC-EXPONENTIAL MULTIPLIER PENALTY FUNCTION

  • Lian, Shu-jun
    • Journal of applied mathematics & informatics
    • /
    • v.28 no.5_6
    • /
    • pp.1477-1487
    • /
    • 2010
  • In this paper, we give a solving approach based on a logarithmic-exponential multiplier penalty function for the constrained minimization problem. It is proved exact in the sense that the local optimizers of a nonlinear problem are precisely the local optimizers of the logarithmic-exponential multiplier penalty problem.

Object Tracking Based on Exactly Reweighted Online Total-Error-Rate Minimization (정확히 재가중되는 온라인 전체 에러율 최소화 기반의 객체 추적)

  • JANG, Se-In;PARK, Choong-Shik
    • Journal of Intelligence and Information Systems
    • /
    • v.25 no.4
    • /
    • pp.53-65
    • /
    • 2019
  • Object tracking is one of important steps to achieve video-based surveillance systems. Object tracking is considered as an essential task similar to object detection and recognition. In order to perform object tracking, various machine learning methods (e.g., least-squares, perceptron and support vector machine) can be applied for different designs of tracking systems. In general, generative methods (e.g., principal component analysis) were utilized due to its simplicity and effectiveness. However, the generative methods were only focused on modeling the target object. Due to this limitation, discriminative methods (e.g., binary classification) were adopted to distinguish the target object and the background. Among the machine learning methods for binary classification, total error rate minimization can be used as one of successful machine learning methods for binary classification. The total error rate minimization can achieve a global minimum due to a quadratic approximation to a step function while other methods (e.g., support vector machine) seek local minima using nonlinear functions (e.g., hinge loss function). Due to this quadratic approximation, the total error rate minimization could obtain appropriate properties in solving optimization problems for binary classification. However, this total error rate minimization was based on a batch mode setting. The batch mode setting can be limited to several applications under offline learning. Due to limited computing resources, offline learning could not handle large scale data sets. Compared to offline learning, online learning can update its solution without storing all training samples in learning process. Due to increment of large scale data sets, online learning becomes one of essential properties for various applications. Since object tracking needs to handle data samples in real time, online learning based total error rate minimization methods are necessary to efficiently address object tracking problems. Due to the need of the online learning, an online learning based total error rate minimization method was developed. However, an approximately reweighted technique was developed. Although the approximation technique is utilized, this online version of the total error rate minimization could achieve good performances in biometric applications. However, this method is assumed that the total error rate minimization can be asymptotically achieved when only the number of training samples is infinite. Although there is the assumption to achieve the total error rate minimization, the approximation issue can continuously accumulate learning errors according to increment of training samples. Due to this reason, the approximated online learning solution can then lead a wrong solution. The wrong solution can make significant errors when it is applied to surveillance systems. In this paper, we propose an exactly reweighted technique to recursively update the solution of the total error rate minimization in online learning manner. Compared to the approximately reweighted online total error rate minimization, an exactly reweighted online total error rate minimization is achieved. The proposed exact online learning method based on the total error rate minimization is then applied to object tracking problems. In our object tracking system, particle filtering is adopted. In particle filtering, our observation model is consisted of both generative and discriminative methods to leverage the advantages between generative and discriminative properties. In our experiments, our proposed object tracking system achieves promising performances on 8 public video sequences over competing object tracking systems. The paired t-test is also reported to evaluate its quality of the results. Our proposed online learning method can be extended under the deep learning architecture which can cover the shallow and deep networks. Moreover, online learning methods, that need the exact reweighting process, can use our proposed reweighting technique. In addition to object tracking, the proposed online learning method can be easily applied to object detection and recognition. Therefore, our proposed methods can contribute to online learning community and object tracking, detection and recognition communities.

Combined Traffic Signal Control and Traffic Assignment : Algorithms, Implementation and Numerical Results

  • Lee, Chung-Won
    • Proceedings of the KOR-KST Conference
    • /
    • 2000.02a
    • /
    • pp.89-115
    • /
    • 2000
  • Traffic signal setting policies and traffic assignment procedures are mutually dependent. The combined signal control and traffic assignment problem deals with this interaction. With the total travel time minimization objective, gradient based local search methods are implemented. Deterministic user equilibrium is the selected user route choice rule, Webster's delay curve is the link performance function, and green time per cycle ratios are decision variables. Three implemented solution codes resulting in six variations include intersections operating under multiphase operation with overlapping traffic movements. For reference, the iterative approach is also coded and all codes are tested in four example networks at five demand levels. The results show the numerical gradient estimation procedure performs best although the simplified local searches show reducing the large network computational burden. Demand level as well as network size affects the relative performance of the local and iterative approaches. As demand level becomes higher, (1) in the small network, the local search tends to outperform the iterative search and (2) in the large network, vice versa.

  • PDF

Embedded Software Minimization Using Don′t Cares (Don′t Care 정보를 이용한 임베디드 소프트웨어의 최적화)

  • Hong, Yu-Pyo
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.37 no.3
    • /
    • pp.48-54
    • /
    • 2000
  • This paper exploits the use of don't cares on software synthesis for embedded systems. Embedded systems have extremely tight real-time and code size constraints. We propose applying BDD minimization techniques in the presence of a don't care set to synthesize code for extended Finite State Machines from a BDD-based representation of the FSM transition function. The don't care set can be derived from local analysis as well as from external information. We show experimental results, discuss their implications, the interactions between BDD-based minimization and dynamic variable reordering, and propose directions for future research.

  • PDF

Nonlinear section model for analysis of RC circular tower structures weakened by openings

  • Lechman, Marek;Stachurski, Andrzej
    • Structural Engineering and Mechanics
    • /
    • v.20 no.2
    • /
    • pp.161-172
    • /
    • 2005
  • This paper presents the section model for analysis of RC circular tower structures based on nonlinear material laws. The governing equations for normal strains due to the bending moment and the normal force are derived in the case when openings are located symmetrically in respect to the bending direction. In this approach the additional reinforcement at openings is also taken into account. The mathematical model is expressed in the form of a set of nonlinear equations which are solved by means of the minimization of the sums of the second powers of the residuals. For minimization the BFGS quasi-Newton and/or Hooke-Jeeves local minimizers suitably modified are applied to take into account the box constraints on variables. The model is verified on the set of data encountered in engineering practice. The numerical examples illustrate the effects of the loading eccentricity and size of the opening on the strains and stresses in concrete and steel in the cross-sections under consideration. Calculated results indicate that the additional reinforcement at the openings increases the resistance capacity of the section by several percent.

Multiagent Scheduling of a Single Machine Under Public Information (공적 정보하에서 단일 설비의 다중 에이전트 스케줄링)

  • Lee, Yong-Kyu;Choi, Yoo-Seong;Jeong, In-Jae
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.32 no.1
    • /
    • pp.72-78
    • /
    • 2009
  • This paper considers a multiagent scheduling problem under public information where a machine is shared by multiple agents. Each agent has a local objective among the minimization of total completion time and the minimization of maximum. In this problem, it is assumed that scheduling information is public. Therefore an agent can access to complete information of other agents and pursue efficient schedules in a centralized manner. We propose an enumeration scheme to find Pareto optimal schedules and a multiobjective genetic algorithm as a heuristic approach. Experimental results indicate that the proposed genetic algorithm yields close-to Pareto optimal solution under a variety of experimental conditions.

Lip Recognition using Lip Shape Model and Down Hill Search Method (입술의 형태 모델과 Down Hill 탐색 방법을 이용한 입술 인식)

  • 이임건;장경식
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.6
    • /
    • pp.968-976
    • /
    • 2003
  • In this paper, we propose a novel method for lip recognition. Lip model is built based on the concatenated gray level distribution model, and the recognition problem is simplified as the minimization problem of matching object function. The Down Hill Simplex Algorithm is used for the minimization with the proposed novel method for setting initial condition, which can refrain Iteration from converging to local minima. The proposed algorithm shows extracting lip shape from the test image where Active Shape Model fails.

  • PDF

An Integration of Local Search and Constraint Programming for Solving Constraint Satisfaction Optimization Problems (제약 만족 최적화 문제의 해결을 위한 지역 탐색과 제약 프로그래밍의 결합)

  • Hwang, Jun-Ha
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.5
    • /
    • pp.39-47
    • /
    • 2010
  • Constraint satisfaction optimization problem is a kind of optimization problem involving cost minimization as well as complex constraints. Local search and constraint programming respectively have been used for solving such problems. In this paper, I propose a method to integrate local search and constraint programming to improve search performance. Basically, local search is used to solve the given problem. However, it is very difficult to find a feasible neighbor satisfying all the constraints when we use only local search. Therefore, I introduced constraint programming as a tool for neighbor generation. Through the experimental results using weighted N-Queens problems, I confirmed that the proposed method can significantly improve search performance.