نتایج جستجو برای: unconstrained optimization problem

تعداد نتایج: 1107072  

This paper presents a numerical solution of a class of fractional optimal control problems (FOCPs) in a bounded domain having a noise function by the spectral Ritz method‎. ‎The Bernstein polynomials with the fractional operational matrix are applied to approximate the unknown functions‎. ‎By substituting these estimated functions into the cost functional‎, ‎an unconstrained nonlinear optimizat...

2010
Manfu Yan Zhifang Liu

Based on the existing Transductive SVM and via introducing smooth function ( , ) P   to construct smooth cored unconstrained optimization problem, this article will build the optimization model accessible to degenerate solutions to generate an improved transductive SVM, introduce simulated annealing to degenerate the optimization problem, and apply such a Support Vector Classifier to generate...

2017
Laura Palagi

The paper presents an overview of global issues in optimization methods for Supervised Learning (SL). We focus on Feedforward Neural Networks with the aim of reviewing global methods specifically devised for the class of continuous unconstrained optimization problems arising both in Multi Layer Perceptron/Deep Networks and in Radial Basis Networks. We first recall the learning optimization para...

Journal: :Networks 2017
Mark W. Lewis Fred Glover

The Quadratic Unconstrained Binary Optimization problem (QUBO) has become a unifying model for representing a wide range of combinatorial optimization problems, and for linking a variety of disciplines that face these problems. A new class of quantum annealing computer that maps QUBO onto a physical qubit network structure with specific size and edge density restrictions is generating a growing...

To prevent an exploit, the security analyst must implement a suitable countermeasure. In this paper, we consider cost-sensitive attack graphs (CAGs) for network vulnerability analysis. In these attack graphs, a weight is assigned to each countermeasure to represent the cost of its implementation. There may be multiple countermeasures with different weights for preventing a single exploit. Also,...

A. Nozari , H.E. Estekanchi,

Numerical simulation of structural response is a challenging issue in earthquake engineering and there has been remarkable progress in this area in the last decade. Endurance Time (ET) method is a new response history based analysis procedure for seismic assessment and structural design in which structures are subjected to a gradually intensifying dynamic excitation and their seismic performanc...

The search for finding the local minimization in unconstrained optimization problems and a fixed point of the gradient system of ordinary differential equations are two close problems. Limited-memory algorithms are widely used to solve large-scale problems, while Rang Kuta's methods are also used to solve numerical differential equations. In this paper, using the concept of sub-space method and...

Journal: :Math. Meth. of OR 2016
Christian Günther Christiane Tammer

This article deals with constrained multi-objective optimization problems. The main purpose of the article is to investigate relationships between constrained and unconstrained multi-objective optimization problems. Under suitable assumptions (e.g., generalized convexity assumptions) we derive a characterization of the set of (strictly, weakly) efficient solutions of a constrained multi-objecti...

2008
DONGCAI SU JUNWEI DONG ZUDUO ZHENG

Focusing on what an optimization problem may comply with, the so-called convergence conditions have been proposed and sequentially a stochastic optimization algorithm named as DSZ algorithm is presented in order to deal with both unconstrained and constrained optimizations. Its principle is discussed in the theoretical model of DSZ algorithm, from which we present a practical model of DSZ algor...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید