Journal of Optimization Theory and Applications

Công bố khoa học tiêu biểu

* Dữ liệu chỉ mang tính chất tham khảo

Sắp xếp:  
Approximate solution of a class of singular control problems
Journal of Optimization Theory and Applications - Tập 13 - Trang 461-483 - 1974
R. B. Vinter
A class of singular control problems involving amplitude constraints on the controls is examined. IfL ∞ is the space of control functionsU, the control constraint setS can be identified with the unit ball inL ∞. Now, for anyn ∈ (1, ∞), an analogous problem may be set up withL n forU and the unit ball inL n forS. This modified ...... hiện toàn bộ
Minimization Algorithms Based on Supervisor and Searcher Cooperation
Journal of Optimization Theory and Applications - Tập 111 Số 2 - Trang 359-379 - 2001
Wenbin Liu, Yu‐Hong Dai
On Convergence Results for Weak Efficiency in Vector Optimization Problems with Equilibrium Constraints
Journal of Optimization Theory and Applications - Tập 133 - Trang 117-121 - 2007
M. B. Lignola, J. Morgan
In this note, we prove that the convergence results for vector optimization problems with equilibrium constraints presented in Wu and Cheng (J. Optim. Theory Appl. 125, 453–472, 2005) are not correct. Actually, we show that results of this type cannot be established at all. This is due to the possible lack, even under nice assumptions, of lower convergence of the solution map for equilibrium prob...... hiện toàn bộ
Book notices
Journal of Optimization Theory and Applications - Tập 50 - Trang 543-545 - 1986
On Higher-Order Sensitivity Analysis in Nonsmooth Vector Optimization
Journal of Optimization Theory and Applications - Tập 162 - Trang 463-488 - 2013
H. T. H. Diem, P. Q. Khanh, L. T. Tung
We propose the notion of higher-order radial-contingent derivative of a set-valued map, develop some calculus rules and use them directly to obtain optimality conditions for several particular optimization problems. Then we employ this derivative together with contingent-type derivatives to analyze sensitivity for nonsmooth vector optimization. Properties of higher-order contingent-type derivative...... hiện toàn bộ
Nearest q-Flat to m Points
Journal of Optimization Theory and Applications - Tập 105 - Trang 249-252 - 2000
P. Tseng
Recently, Bradley and Mangasarian studied the problem of finding the nearest plane to m given points in ℝn in the least square sense. They showed that the problem reduces to finding the least eigenvalue and associated eigenvector of a certain n×n symmetric positive-semidefinite matrix. We extend this result to the general problem of finding the nearest q-flat to m points, with 0≤q≤n−1.
Infinite-Horizon Stochastic Differential Games with Branching Payoffs
Journal of Optimization Theory and Applications - Tập 111 - Trang 445-460 - 2001
D. W. K. Yeung
In this paper, we consider infinite-horizon stochastic differential games with an autonomous structure and steady branching payoffs. While the introduction of additional stochastic elements via branching payoffs offers a fruitful alternative to modeling game situations under uncertainty, the solution to such a problem is not known. A theorem on the characterization of a Nash equilibrium solution f...... hiện toàn bộ
Partial differential equations and finite-difference methods in image processing, part 1: Image representation
Journal of Optimization Theory and Applications - Tập 23 - Trang 65-91 - 1977
A. K. Jain
Stochastic representation of discrete images by partial differential equation operators is considered. It is shown that these representations can fit random images, with nonseparable, isotropic covariance functions, better than other common covariance models. Application of these models in image restoration, data compression, edge detection, image synthesis, etc., is possible. Different representa...... hiện toàn bộ
Geometrical characterization of weakly efficient points
Journal of Optimization Theory and Applications - Tập 90 - Trang 217-223 - 1996
F. Plastria, E. Carrizosa
In this note, we present a geometrical characterization of the set of weakly efficient points in constrained convex multiobjective optimization problems, valid for a compact set of objectives.
Universal Alignment Probability Revisited
Journal of Optimization Theory and Applications - Tập 113 - Trang 399-407 - 2002
S.Y. Lin, Y.C. Ho
In this note, we quantify and validate the representativeness of the uniformly sampled set N for the search space Θ and the use of universal alignment probability (UAP) curves.
Tổng số: 6,084   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10