129 results
Search Results
2. A Reply to a Note on the Paper 'A Simplified Novel Technique for Solving Fully Fuzzy Linear Programming Problems'.
- Author
-
Khan, Izaz, Ahmad, Tahir, and Maan, Normah
- Subjects
- *
LINEAR programming , *FUZZY algorithms , *ALGORITHMS , *MATHEMATICS , *MATHEMATICAL programming - Abstract
This note tries to answer issues raised in Bhardwaj and Kumar (J Optim Theory Appl 163(2): 685-696, 2014). The research summarizes that the results obtained in Khan et al. (J Optim Theory Appl 159: 536-546, 2013) are sound and correct and it fulfills all the necessary requirements of its scope and objectives. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
3. Preparation of Papers.
- Subjects
- *
PERIODICAL publishing , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *SIMULATION methods & models , *MATHEMATICS , *PERIODICALS - Abstract
This article provides instructions in preparing a paper for publication in the "Journal of Optimization Theory and Applications." Some of these guidelines are the following: 1)submission of manuscripts in triplicate; 2) reference to English as the official language of the journal; 3) inclusion of an abstract of at least 50 to 100 words in each contribution; and, 4) the abstract should be followed by a list of four to five key words identifying the subject.
- Published
- 2005
- Full Text
- View/download PDF
4. Preparation of Papers.
- Subjects
- *
PERIODICALS , *SCHOLARLY periodicals , *ACADEMIC discourse , *SCHOLARLY communication , *SCHOLARLY publishing , *MATHEMATICS - Abstract
Provides instructions for contributing authors of the "Journal of Optimization Theory and Applications." Overall style of the journal; Language to be used; Inclusion of abstracts and key words in the papers.
- Published
- 2004
5. Preparation of Papers.
- Subjects
- *
PERIODICALS , *MATHEMATICS , *ACADEMIC discourse , *SCHOLARLY communication , *SCHOLARLY publishing - Abstract
Provides instructions for contributing authors to the "Journal of Optimization Theory and Applications." Official language to be used; Inclusion of abstracts and key words in the papers; Format for writing mathematical formulas.
- Published
- 2004
6. Random Multifunctions as Set Minimizers of Infinitely Many Differentiable Random Functions.
- Author
-
Garrido, Juan Guillermo, Pérez-Aros, Pedro, and Vilches, Emilio
- Subjects
- *
DIFFERENTIABLE functions , *RANDOM sets , *INTEGRAL functions , *MATHEMATICS - Abstract
Under mild assumptions, we prove that any random multifunction can be represented as the set of minimizers of an infinitely many differentiable normal integrand, which preserves the convexity of the random multifunction. This result is an extended random version of work done by Azagra and Ferrera (Proc Am Math Soc 130(12):3687–3692, 2002). We provide several applications of this result to the approximation of random multifunctions and integrands. The paper ends with a characterization of the set of integrable selections of a measurable multifunction as the set of minimizers of an infinitely many differentiable integral function. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Generalized Set-valued Nonlinear Variational-like Inequalities and Fixed Point Problems: Existence and Approximation Solvability Results.
- Author
-
Balooee, Javad, Chang, Shih-sen, and Yao, Jen-Chih
- Subjects
- *
NONEXPANSIVE mappings , *BANACH spaces , *POINT set theory , *MATHEMATICS , *EQUATIONS - Abstract
The paper is devoted to the introduction of a new class of generalized set-valued nonlinear variational-like inequality problems in the setting of Banach spaces. By means of the notion of P- η -proximal mapping, we prove its equivalence with a class of generalized implicit Wiener–Hopf equations and employ the obtained equivalence relationship and Nadler's technique to suggest a new iterative algorithm for finding an approximate solution of the considered problem. The existence of solution and the strong convergence of the sequences generated by our proposed iterative algorithm to the solution of our considered problem are verified. The problem of finding a common element of the set of solutions of a generalized nonlinear variational-like inequality problem and the set of fixed points of a total asymptotically nonexpansive mapping is also investigated. The final section deals with the investigation and analysis of the main results appeared in Kazmi and Bhat (Appl Math Comput 166:164–180, 2005) and some comments relating to them are given. The results presented in this article extend and improve some known results in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
8. Superfast Second-Order Methods for Unconstrained Convex Optimization.
- Author
-
Nesterov, Yurii
- Subjects
- *
MATHEMATICS , *CONFERENCES & conventions - Abstract
In this paper, we present new second-order methods with convergence rate O k - 4 , where k is the iteration counter. This is faster than the existing lower bound for this type of schemes (Agarwal and Hazan in Proceedings of the 31st conference on learning theory, PMLR, pp. 774–792, 2018; Arjevani and Shiff in Math Program 178(1–2):327–360, 2019), which is O k - 7 / 2 . Our progress can be explained by a finer specification of the problem class. The main idea of this approach consists in implementation of the third-order scheme from Nesterov (Math Program 186:157–183, 2021) using the second-order oracle. At each iteration of our method, we solve a nontrivial auxiliary problem by a linearly convergent scheme based on the relative non-degeneracy condition (Bauschke et al. in Math Oper Res 42:330–348, 2016; Lu et al. in SIOPT 28(1):333–354, 2018). During this process, the Hessian of the objective function is computed once, and the gradient is computed O ln 1 ϵ times, where ϵ is the desired accuracy of the solution for our problem. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
9. Optimality Conditions for Convex Semi-infinite Programming Problems with Finitely Representable Compact Index Sets.
- Author
-
Kostyukova, Olga and Tchemisova, Tatiana
- Subjects
- *
MATHEMATICAL programming , *FUNCTIONAL equations , *MATHEMATICAL optimization , *MATHEMATICS , *CONVEX functions , *REAL variables - Abstract
In the present paper, we analyze a class of convex semi-infinite programming problems with arbitrary index sets defined by a finite number of nonlinear inequalities. The analysis is carried out by employing the constructive approach, which, in turn, relies on the notions of immobile indices and their immobility orders. Our previous work showcasing this approach includes a number of papers dealing with simpler cases of semi-infinite problems than the ones under consideration here. Key findings of the paper include the formulation and the proof of implicit and explicit optimality conditions under assumptions, which are less restrictive than the constraint qualifications traditionally used. In this perspective, the optimality conditions in question are also compared to those provided in the relevant literature. Finally, the way to formulate the obtained optimality conditions is demonstrated by applying the results of the paper to some special cases of the convex semi-infinite problems. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
10. An Infeasible Stochastic Approximation and Projection Algorithm for Stochastic Variational Inequalities.
- Author
-
Zhang, Xiao-Juan, Du, Xue-Wu, Yang, Zhen-Ping, and Lin, Gui-Hua
- Subjects
- *
APPROXIMATION algorithms , *CONJUGATE gradient methods , *STOCHASTIC approximation , *STOCHASTIC processes , *MATHEMATICAL equivalence , *SEARCH algorithms , *MATHEMATICAL inequalities , *MATHEMATICS - Abstract
In this paper, we consider a stochastic variational inequality, in which the mapping involved is an expectation of a given random function. Inspired by the work of He (Appl Math Optim 35:69–76, 1997) and the extragradient method proposed by Iusem et al. (SIAM J Optim 29:175–206, 2019), we propose an infeasible projection algorithm with line search scheme, which can be viewed as a modification of the above-mentioned method of Iusem et al. In particular, in the correction step, we replace the projection by computing search direction and stepsize, that is, we need only one projection at each iteration, while the method of Iusem et al. requires two projections at each iteration. Moreover, we use dynamic sampled scheme with line search to cope with the absence of Lipschitz constant and choose the stepsize to be bounded away from zero and the direction to be a descent direction. In the process of stochastic approximation, we iteratively reduce the variance of a stochastic error. Under appropriate assumptions, we derive some properties related to convergence, convergence rate, and oracle complexity. In particular, compared with the method of Iusem et al., our method uses less projections and has the same iteration complexity, which, however, has a higher oracle complexity for a given tolerance in a finite dimensional space. Finally, we report some numerical experiments to show its efficiency. [ABSTRACT FROM AUTHOR]
- Published
- 2019
- Full Text
- View/download PDF
11. A Bidding Game with Heterogeneous Players.
- Author
-
Bressan, Alberto and Wei, Deling
- Subjects
- *
EQUATIONS , *ALGEBRA , *MATHEMATICS , *PRICING , *MARKETING - Abstract
A one-sided limit order book is modeled as a noncooperative game for several players. Agents offer various quantities of an asset at different prices, competing to fulfill an incoming order, whose size is not known a priori. Players can have different payoff functions, reflecting different beliefs about the fundamental value of the asset and probability distribution of the random incoming order. In a previous paper, the existence of a Nash equilibrium was established by means of a fixed point argument. The main issue discussed in the present paper is whether this equilibrium can be obtained from the unique solution to a two-point boundary value problem, for a suitable system of discontinuous ordinary differential equations. Some additional assumptions are introduced, which yield a positive answer. In particular, this is true when there are exactly two players, or when all players assign the same exponential probability distribution to the incoming order. In both of these cases, we also prove that the Nash equilibrium is unique. A counterexample shows that these assumptions cannot be removed, in general. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
12. Extended Antipodal Theorems.
- Author
-
Kalashnikov, Viacheslav V., Talman, Adolphus J. J., Alanís-López, Lilia, and Kalashnykova, Nataliya I.
- Subjects
- *
MATHEMATICS theorems , *MATHEMATICS , *MATHEMATICAL models , *SIMULATION methods & models , *GRAPH theory - Abstract
Since 1909 when Brouwer proved the first fixed-point theorem named after him, the fixed-point results in various settings play an important role in the optimization theory and applications. This technique has proven to be indispensable for the proofs of multiple results related to the existence of solutions to numerous problems in the areas of optimization and approximation theory, differential equations, variational inequalities, complementary problems, equilibrium theory, game theory, mathematical economics, etc. It is also worthwhile to mention that the majority of problems of finding solutions (zero-points) of functions (operators) can be easily reduced to that of discovering of fixed points of properly modified mappings. Not only theoretical but also practical (algorithmic) developments are based on the fixed-point theory. For instance, the well-known simplicial (triangulation) algorithms help one to find the desired fixed points in a constructive way. That approach allows one to investigate the solvability of complicated problems arising in theory and applications. In this paper, making use of the triangulation technique, we extend some antipodal and fixed-point theorems to the case of nonconvex, more exactly, star-shaped sets. Also, similar extensions are made for set-valued mappings defined over star-shaped sets. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
13. Optimization of Mayer Problem with Sturm-Liouville-Type Differential Inclusions.
- Author
-
Mahmudov, Elimhan N.
- Subjects
- *
DIFFERENTIAL equations , *CALCULUS , *MATHEMATICAL physics , *MATHEMATICAL optimization , *MATHEMATICS - Abstract
The present paper studies a new class of problems of optimal control theory with Sturm-Liouville-type differential inclusions involving second-order linear self-adjoint differential operators. Our main goal is to derive the optimality conditions of Mayer problem for differential inclusions with initial point constraints. By using the discretization method guaranteeing transition to continuous problem, the discrete and discrete-approximation inclusions are investigated. Necessary and sufficient conditions, containing both the Euler-Lagrange and Hamiltonian-type inclusions and “transversality” conditions are derived. The idea for obtaining optimality conditions of Mayer problem is based on applying locally adjoint mappings. This approach provides several important equivalence results concerning locally adjoint mappings to Sturm-Liouville-type set-valued mappings. The result strengthens and generalizes to the problem with a second-order non-self-adjoint differential operator; a suitable choice of coefficients then transforms this operator to the desired Sturm-Liouville-type problem. In particular, if a positive-valued, scalar function specific to Sturm-Liouville differential inclusions is identically equal to one, we have immediately the optimality conditions for the second-order discrete and differential inclusions. Furthermore, practical applications of these results are demonstrated by optimization of some “linear” optimal control problems for which the Weierstrass-Pontryagin maximum condition is obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2018
- Full Text
- View/download PDF
14. Restricted Robinson Constraint Qualification and Optimality for Cardinality-Constrained Cone Programming.
- Author
-
Pan, Lili, Luo, Ziyan, and Xiu, Naihua
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *COST functions , *SYSTEM analysis , *MATHEMATICS - Abstract
In this paper, optimality conditions are presented and analyzed for the cardinality-constrained cone programming arising from finance, statistical regression, signal processing, etc. By introducing a restricted form of (strict) Robinson constraint qualification, the first-order optimality conditions for the cardinality-constrained cone programming are established based upon the properties of the normal cone. After characterizing further the second-order tangent set to the cardinality-constrained system, the second-order optimality conditions are also presented under some mild conditions. These proposed optimality conditions, to some extent, enrich the optimization theory for noncontinuous and nonconvex programming problems. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
15. Further on Set-Valued Equilibrium Problems and Applications to Browder Variational Inclusions.
- Author
-
Alleche, Boualem and Rădulescu, Vicenţiu
- Subjects
- *
CONTINUITY , *PHILOSOPHY of mathematics , *EQUILIBRIUM , *VARIATIONAL inequalities (Mathematics) , *MATHEMATICS - Abstract
In this paper, we introduce some concepts of convexity and semicontinuity for real set-valued mappings similar to those of real single-valued mappings. Then, we obtain different results on the existence of solutions of set-valued equilibrium problems generalizing in a common way several old ones for both single-valued and set-valued equilibrium problems. Applications to Browder variational inclusions, with weakened conditions on the involved set-valued operator, are given. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
16. Existence of the Equilibrium in Choice.
- Author
-
Patriche, Monica
- Subjects
- *
EQUILIBRIUM , *MATHEMATICS , *SCIENTIFIC literature , *GAMES , *STATICS - Abstract
In this paper, we prove the existence of the equilibrium in choice for games in choice form. Thus, we add to the research recently appeared in the scientific literature. In fact, our results link the most recent research to the older approaches of the games in normal-form and the qualitative games. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
17. Optimization Implementation and Characterization of the Equal Allocation of Nonseparable Costs Value.
- Author
-
Sun, Panfei, Hou, Dongshuang, Sun, Hao, and Driessen, Theo
- Subjects
- *
NUCLEOLUS , *LEXICOGRAPHY , *COOPERATIVE game theory , *GAME theory , *MATHEMATICS - Abstract
This paper devotes to the study of the equal allocation of nonseparable costs value for cooperative games. On the one hand, we show that the equal allocation of nonseparable costs value is the unique optimal solution that minimizes the total complaints for individual players over the pre-imputation set. On the other hand, analogously to the way of determining the Nucleolus, we obtain the equal allocation of nonseparable costs value by applying the lexicographic order over the individual complaints. Moreover, we offer alternative characterizations of the equal allocation of nonseparable costs value by proposing several new properties such as dual nullifying player property, dual dummifying player property and grand marginal contribution monotonicity. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
18. General Maximum Principles for Partially Observed Risk-Sensitive Optimal Control Problems and Applications to Finance.
- Author
-
Wang, G. C. and Wu, Z.
- Subjects
- *
VARIATIONAL inequalities (Mathematics) , *CALCULUS of variations , *DIFFERENTIAL inequalities , *FINANCE , *RISK management in business , *RISK assessment , *FINANCIAL risk management , *MATHEMATICS , *INVESTMENTS - Abstract
This paper is concerned with partially observed risk-sensitive optimal control problems. Combining Girsanov’s theorem with a standard spike variational technique, we obtain some general maximum principles for the aforementioned problems. One of the distinctive differences between our results and the standard risk-neutral case is that the adjoint equations and variational inequalities strongly depend on a risk-sensitive parameter γ. Two examples are given to illustrate the applications of the theoretical results obtained in this paper. As a natural deduction, a general maximum principle is also obtained for a fully observed risk-sensitive case. At last, this result is applied to study a risk-sensitive optimal portfolio problem. An explicit optimal investment strategy and a cost functional are obtained. A numerical simulation result shows the influence of a risk-sensitive parameter on an optimal investment proportion; this coincides with its economic meaning and theoretical results. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
19. Universal Alignment Probability Revisited.
- Author
-
Shen, Z., Zhao, Q., Jia, Q.-S., and Sun, J.
- Subjects
- *
PROBABILITY theory , *EQUATIONS , *MATHEMATICAL optimization , *COMBINATORICS , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
We found a minor error in the proof of paper “Universal Alignment Probability Revisited” by S.Y. Lin and Y.C. Ho (J. Optim. Theory Appl. 113(2):399–407, ). In this note, we give a counterexample and explain the reason. We also show that the conclusion of that paper is still correct despite this minor error. A new proof of the conclusion is given. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
20. Stability of Indices in the KKT Conditions and Metric Regularity in Convex Semi-Infinite Optimization.
- Author
-
Cánovas, M. J., Hantoute, A., López, M. A., and Parra, J.
- Subjects
- *
CONVEX programming , *MATHEMATICAL programming , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *ALGEBRA - Abstract
This paper deals with a parametric family of convex semi-infinite optimization problems for which linear perturbations of the objective function and continuous perturbations of the right-hand side of the constraint system are allowed. In this context, Cánovas et al. (SIAM J. Optim. 18:717–732, []) introduced a sufficient condition (called ENC in the present paper) for the strong Lipschitz stability of the optimal set mapping. Now, we show that ENC also entails high stability for the minimal subsets of indices involved in the KKT conditions, yielding a nice behavior not only for the optimal set mapping, but also for its inverse. Roughly speaking, points near optimal solutions are optimal for proximal parameters. In particular, this fact leads us to a remarkable simplification of a certain expression for the (metric) regularity modulus given in Cánovas et al. (J. Glob. Optim. 41:1–13, []) (and based on Ioffe (Usp. Mat. Nauk 55(3):103–162, []; Control Cybern. 32:543–554, [])), which provides a key step in further research oriented to find more computable expressions of this regularity modulus. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
21. Solution Methods for Pseudomonotone Variational Inequalities.
- Author
-
Tam, N. N., Yao, J. C., and Yen, N. D.
- Subjects
- *
VARIATIONAL inequalities (Mathematics) , *CALCULUS of variations , *DIFFERENTIAL inequalities , *STOCHASTIC convergence , *MATHEMATICAL functions , *MATHEMATICAL inequalities , *MONOTONE operators , *OPERATOR theory , *MATHEMATICS - Abstract
We extend some results due to Thanh-Hao (Acta Math. Vietnam. 31: 283-289, 2006) and Noor (J. Optim. Theory Appl. 115:447-452, 2002). The first paper established a convergence theorem for the Tikhonov regularization method (TRM) applied to finite-dimensional pseudomonotone variational inequalities (VIs), answering in the affirmative an open question stated by Facchinei and Pang (Finite- Dimensional Variational Inequalities and Complementarity Problems, Springer, New York, 2003). The second paper discussed the application of the proximal point algorithm (PPA) to pseudomonotone VIs. In this paper, new facts on the convergence of TRM and PPA (both the exact and inexact versions of PPA) for pseudomonotone VIs in Hilbert spaces are obtained and a partial answer to a question stated in (Acta Math. Vietnam. 31:283-289, 2006) is given. As a byproduct, we show that the convergence theorem for inexact PPA applied to infinite-dimensional monotone variational inequalities can be proved without using the theory of maximal monotone operators. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
22. Globally Convergent Optimization Algorithms on Riemannian Manifolds: Uniform Framework for Unconstrained and Constrained Optimization.
- Author
-
Yang, Y.
- Subjects
- *
RIEMANNIAN manifolds , *MANIFOLDS (Mathematics) , *DIFFERENTIAL geometry , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *ACCELERATION of convergence in numerical analysis , *STOCHASTIC convergence , *ALGORITHMS , *MATHEMATICS - Abstract
This paper proposes several globally convergent geometric optimization algorithms on Riemannian manifolds, which extend some existing geometric optimization techniques. Since any set of smooth constraints in the Euclidean space Rn (corresponding to constrained optimization) and the Rn space itself (corresponding to unconstrained optimization) are both special Riemannian manifolds, and since these algorithms are developed on general Riemannian manifolds, the techniques discussed in this paper provide a uniform framework for constrained and unconstrained optimization problems. Unlike some earlier works, the new algorithms have less restrictions in both convergence results and in practice. For example, global minimization in the one-dimensional search is not required. All the algorithms addressed in this paper are globally convergent. For some special Riemannian manifold other than Rn, the newalgorithms are very efficient. Convergence rates are obtained. Applications are discussed. [ABSTRACT FROM AUTHOR]
- Published
- 2007
- Full Text
- View/download PDF
23. Sufficient Optimality Criterion for Linearly Constrained, Separable Concave Minimization Problems.
- Author
-
Illés, T. and Nagy, Á B.
- Subjects
- *
LINEAR programming , *MATHEMATICAL programming , *MATRICES (Mathematics) , *BRANCH & bound algorithms , *ALGORITHMS , *MATHEMATICS - Abstract
A sufficient optimality criterion for linearly-constrained concave minimization problems is given in this paper. Our optimally criterion is based on the sensitivity analysis of the relaxed linear programming Problem. The main result is similar to that of Phillips and Rosen (Ref. 1); however, our proofs are simpler and constructive. In the Phillip and Rosen paper (Ref.1), they derived a sufficient optimality criterion for a slightly different linearly-constrained concave minimization problem using exponentially many linear programming problems. We introduce special test points and, using these for several cases, we are able to show optimally of the current basic solution. The sufficient optimality criterion described in this paper can be used as a stopping criterion for branch-and-bound algorithm developed for linearly-constrained concave minimization problems. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
24. The Genesis of Differential Games in Light of Isaacs' Contributions.
- Author
-
Breitner, M. H.
- Subjects
- *
DIFFERENTIAL games , *GAME theory , *MATHEMATICAL models , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *SIMULATION methods & models , *MATHEMATICS - Abstract
Rufus P. Isaacs joined the RAND Corporation4. Santa Monica, California in 1948 and started to develop the theory of dynamic games in the early 1950s. Until winter 1954/55, when Isaacs left the RAND Corporation, he investigated two player. zero-sum dynamic games of the classic pursuit-evasion type. Prior to 1965, Isaacs published his theory only in internal RAND papers and research memoranda. In his first RAND paper (Ref. 1), Isaacs sketched the basic ideas of zero-sum dynamic game theory The ideas already included rudimentary precursors of the maximum principle, dynamic programming, and backward analysis. At the end of 1954 and the beginning of 1955. Isaacs summarized his research in four research memoranda (Refs. 3–6), which ten years later formed the basis of his famous book on Differential Games (Ref. 7). This paper survey's Isaacs' research with an emphasis on the early years of dynamic games. The readers are kindly invited to discuss the author's point of view. Comments and statements sent to the author will be summarized and published later. [ABSTRACT FROM AUTHOR]
- Published
- 2005
- Full Text
- View/download PDF
25. Evaluating Gradients in Optimal Control: Continuous Adjoints versus Automatic Differentiation.
- Author
-
Griesse, R., Walther, A., and Pesch, H. J.
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICS , *MATHEMATICAL analysis , *NUMERICAL analysis , *MATHEMATICAL functions , *COMPUTER programming - Abstract
This paper deals with the numerical solution of optimal control problems for ODEs. The methods considered here rely on some standard optimization code to solve a discretized version of the control problem under consideration. We aim to make available to the optimization software not only the discrete objective functional, but also its gradient. The objective gradient can be computed either from forward (sensitivity) information or backward (adjoint) information. The purpose of this paper is to discuss various ways of adjoint computation. It will be shown both theoretically and numerically that methods based on the continuous adjoint equation require a careful choice of both the integrator and gradient assembly formulas in order to obtain a gradient consistent with the discretized control problem. Particular attention is given to automatic differentiation techniques which generate automatically a suitable integrator. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
26. Application of Feedback Linearization to Tracking and Almost Disturbance Decoupling Control of the AMIRA Ball and Beam System.
- Author
-
Chen, C.C., Chien, T.L., and Wei, C.L.
- Subjects
- *
NONLINEAR control theory , *NONLINEAR theories , *CONTROL theory (Engineering) , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
This paper studies the tracking and almost disturbance decoupling problem of the nonlinear AMIRA ball and beam system based on the feedback linearization approach. The main contribution of this study is to construct a controller, under appropriate conditions, such that the resulting closed-loop system is valid for any initial condition and bounded tracking signal with the following characteristics: input-to-state stability with respect to disturbance inputs and almost disturbance decoupling. Two examples on the almost disturbance decoupling problem, which cannot be solved via Ref. 1, are proposed in this paper exploiting the fact that the tracking and the almost disturbance decoupling performances are easily achieved by our proposed approach. [ABSTRACT FROM AUTHOR]
- Published
- 2004
- Full Text
- View/download PDF
27. Sequential Penalty Algorithm for Nonlinear Constrained Optimization.
- Author
-
Zhang, J.L. and Zhang, X.S.
- Subjects
- *
ALGORITHMS , *MATHEMATICAL optimization , *NONLINEAR theories , *STOCHASTIC convergence , *MATHEMATICS , *MATHEMATICAL analysis - Abstract
In this paper, a new sequential penalty algorithm, based on the L[sub ∞] exact penalty function, is proposed for a general nonlinear constrained optimization problem. The algorithm has the following characteristics: it can start from an arbitrary initial point; the feasibility of the subproblem is guaranteed; the penalty parameter is adjusted automatically; global convergence without any regularity assumption is proved. The update formula of the penalty parameter is new. It is proved that the algorithm proposed in this paper behaves equivalently to the standard SQP method after sufficiently many iterations. Hence, the local convergence results of the standard SQP method can be applied to this algorithm. Preliminary numerical experiments show the efficiency and stability of the algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2003
- Full Text
- View/download PDF
28. Stability of Solutions to Hamilton-Jacobi Equations Under State Constraints.
- Author
-
Sedrakyan, Hayk
- Subjects
- *
MATHEMATICAL equivalence , *NUMERICAL analysis , *MATHEMATICS , *ALGEBRA - Abstract
In the present paper, we investigate stability of solutions of Hamilton-Jacobi-Bellman equations under state constraints by studying stability of value functions of a suitable family of Bolza optimal control problems under state constraints. The stability is guaranteed by the classical assumptions imposed on Hamiltonians and an inward-pointing condition on state constraints. [ABSTRACT FROM AUTHOR]
- Published
- 2016
- Full Text
- View/download PDF
29. Comments on 'On the Indefinite Quadratic Fractional Optimization with Two Quadratic Constraints'.
- Author
-
Fallahi, Saeed and Salahi, Maziar
- Subjects
- *
QUADRATIC equations , *ALGEBRAIC equations , *CONSTRAINT algorithms , *MATHEMATICS , *MATHEMATICAL optimization - Abstract
In this note, with reference to a paper by the same authors, we add an extra assumption, correct the statement of Lemma 2.1 and subsequently correct the proof of this lemma. [ABSTRACT FROM AUTHOR]
- Published
- 2017
- Full Text
- View/download PDF
30. Second-Order Optimality Conditions for Vector Problems with Continuously Fréchet Differentiable Data and Second-Order Constraint Qualifications.
- Author
-
Ivanov, Vsevolod
- Subjects
- *
MATHEMATICAL optimization , *VECTORS (Calculus) , *MATHEMATICAL analysis , *MATHEMATICS , *OPERATIONS research - Abstract
In the present paper, we consider the inequality constrained vector problem with continuously Fréchet differentiable objective functions and constraints. We obtain second-order necessary optimality conditions of Karush-Kuhn-Tucker type for weak efficiency. A new second-order constraint qualification of Zangwill type is introduced. It is applied in the optimality conditions. Some connections with other constraint qualifications are established. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
31. A Note on Optimality Conditions for Multi-objective Problems with a Euclidean Cone of Preferences.
- Author
-
Golubin, A.
- Subjects
- *
PARETO optimum , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *MAXIMA & minima , *OPERATIONS research - Abstract
The paper suggests a new-to the best of the author's knowledge-characterization of decisions, which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a prescribed angular radius. The main idea is to use the angle distances between the unit vector and points of utility space. A necessary and sufficient condition for the optimality in the form of an equation is derived. The first-order necessary optimality conditions are also obtained. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
32. Descent and Penalization Techniques for Equilibrium Problems with Nonlinear Constraints.
- Author
-
Bigi, Giancarlo and Passacantando, Mauro
- Subjects
- *
EQUILIBRIUM , *MATHEMATICS , *NONLINEAR analysis , *MATHEMATICAL analysis , *ALGORITHMS - Abstract
This paper deals with equilibrium problems with nonlinear constraints. Exploiting a gap function which relies on a polyhedral approximation of the feasible region, we propose two descent methods. They are both based on the minimization of a suitable exact penalty function, but they use different rules for updating the penalization parameter and they rely on different types of line search. The convergence of both algorithms is proved under standard assumptions. [ABSTRACT FROM AUTHOR]
- Published
- 2015
- Full Text
- View/download PDF
33. Geometrical and Topological Properties of a Parameterized Binary Relation in Vector Optimization.
- Author
-
Sommer, Christian
- Subjects
- *
GEOMETRY , *MATHEMATICS , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MAXIMA & minima - Abstract
In real linear spaces, partial orderings are usually generated by ordering cones. In many situations, however, such an ordering cone is too small with respect to the whole space. Therefore, in this paper, we extend the concept of ordering cones to a more general concept. For this purpose, we define a parameterized binary relation, based on a convex cone and a binary function. We investigate some geometrical and topological properties of this relation in detail. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
34. Epsilon-Ritz Method for Solving a Class of Fractional Constrained Optimization Problems.
- Author
-
Lotfi, Ali and Yousefi, Sohrab
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *RITZ method , *BOUNDARY value problems - Abstract
In this paper, epsilon and Ritz methods are applied for solving a general class of fractional constrained optimization problems. The goal is to minimize a functional subject to a number of constraints. The functional and constraints can have multiple dependent variables, multiorder fractional derivatives, and a group of initial and boundary conditions. The fractional derivative in the problem is in the Caputo sense. The constrained optimization problems include isoperimetric fractional variational problems (IFVPs) and fractional optimal control problems (FOCPs). In the presented approach, first by implementing epsilon method, we transform the given constrained optimization problem into an unconstrained problem, then by applying Ritz method and polynomial basis functions, we reduce the optimization problem to the problem of optimizing a real value function. The choice of polynomial basis functions provides the method with such a flexibility that initial and boundary conditions can be easily imposed. The convergence of the method is analytically studied and some illustrative examples including IFVPs and FOCPs are presented to demonstrate validity and applicability of the new technique. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
35. Constrained Nonconvex Nonsmooth Optimization via Proximal Bundle Method.
- Author
-
Yang, Yang, Pang, Liping, Ma, Xuefei, and Shen, Jie
- Subjects
- *
NONSMOOTH optimization , *MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *MAXIMA & minima - Abstract
In this paper, we consider a constrained nonconvex nonsmooth optimization, in which both objective and constraint functions may not be convex or smooth. With the help of the penalty function, we transform the problem into an unconstrained one and design an algorithm in proximal bundle method in which local convexification of the penalty function is utilized to deal with it. We show that, if adding a special constraint qualification, the penalty function can be an exact one, and the sequence generated by our algorithm converges to the KKT points of the problem under a moderate assumption. Finally, some illustrative examples are given to show the good performance of our algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
36. Multi-objective Optimization of Zero Propellant Spacecraft Attitude Maneuvers.
- Author
-
Zhang, S., Tang, G., Friswell, M., and Wagg, D.
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *PROPELLANTS , *COMBUSTION - Abstract
The zero propellant maneuver (ZPM) is an advanced space station, large angle attitude maneuver technique, using only control momentum gyroscopes (CMGs). Path planning is the key to success, and this paper studies the associated multi-objective optimization problem. Three types of maneuver optimal control problem are formulated: (i) momentum-optimal, (ii) time-optimal, and (iii) energy-optimal. A sensitivity analysis approach is used to study the Pareto optimal front and allows the tradeoffs between the performance indices to be investigated. For example, it is proved that the minimum peak momentum decreases as the maneuver time increases, and the minimum maneuver energy decreases if a larger momentum is available from the CMGs. The analysis is verified and complemented by the numerical computations. Among the three types of ZPM paths, the momentum-optimal solution and the time-optimal solution generally possess the same structure, and they are singular. The energy-optimal solution saves significant energy, while generally maintaining a smooth control profile. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
37. Switching Time and Parameter Optimization in Nonlinear Switched Systems with Multiple Time-Delays.
- Author
-
Liu, Chongyang, Loxton, Ryan, and Teo, Kok
- Subjects
- *
MATHEMATICAL optimization , *MATHEMATICAL analysis , *MATHEMATICS , *DELAY lines , *AUTOMATIC control systems - Abstract
In this paper, we consider a dynamic optimization problem involving a general switched system that evolves by switching between several subsystems of nonlinear delay-differential equations. The optimization variables in this system consist of: (1) the times at which the subsystem switches occur; and (2) a set of system parameters that influence the subsystem dynamics. We first establish the existence of the partial derivatives of the system state with respect to both the switching times and the system parameters. Then, on the basis of this result, we show that the gradient of the cost function can be computed by solving the state system forward in time followed by a costate system backward in time. This gradient computation procedure can be combined with any gradient-based optimization method to determine the optimal switching times and parameters. We propose an effective optimization algorithm based on this idea. Finally, we consider three numerical examples, one involving the 1,3-propanediol fed-batch production process, to illustrate the effectiveness and applicability of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
38. Enhanced Karush-Kuhn-Tucker Conditions for Mathematical Programs with Equilibrium Constraints.
- Author
-
Ye, Jane and Zhang, Jin
- Subjects
- *
MATHEMATICAL programming , *COMPUTER programming , *FUNCTIONAL equations , *EQUILIBRIUM , *MATHEMATICS - Abstract
In this paper, we study necessary optimality conditions for nonsmooth mathematical programs with equilibrium constraints. We first show that, unlike the smooth case, the mathematical program with equilibrium constraints linear independent constraint qualification is not a constraint qualification for the strong stationary condition when the objective function is nonsmooth. We then focus on the study of the enhanced version of the Mordukhovich stationary condition, which is a weaker optimality condition than the strong stationary condition. We introduce the quasi-normality and several other new constraint qualifications and show that the enhanced Mordukhovich stationary condition holds under them. Finally, we prove that quasi-normality with regularity implies the existence of a local error bound. [ABSTRACT FROM AUTHOR]
- Published
- 2014
- Full Text
- View/download PDF
39. An Extension of the Fermat-Torricelli Problem.
- Author
-
Tan, T. V.
- Subjects
- *
MATHEMATICAL optimization , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS , *CALCULUS - Abstract
The Fermat-Torricelli problem is an optimization problem associated with a finite subset $\{a_{j}\}_{j=1}^{q}$ of ℝ and a family $\{c_{j}\}_{j=1}^{q}$ of positive weights. The function F to be minimized is defined by $F(x)=\sum _{j=1}^{q}c_{j}\Vert x-a_{j}\Vert$. In this paper, we extend this problem to the case of volumes. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
40. Identification of the Time Derivative Coefficient in a Fast Diffusion Degenerate Equation.
- Author
-
Favini, A. and Marinoschi, G.
- Subjects
- *
EQUATIONS , *ALGEBRA , *SET theory , *MATHEMATICS , *ELLIPSES (Geometry) - Abstract
In this paper, we deal with the identification of the space variable time derivative coefficient u in a degenerate fast diffusion differential inclusion. The function u is vanishing on a subset strictly included in the space domain Ω. This problem is approached as a control problem (P) with the control u. An approximating control problem (P) is introduced and the existence of an optimal pair is proved. Under certain assumptions on the initial data, the control is found in W(Ω), with m> N, in an implicit variational form. Next, it is shown that a sequence of optimal pairs $(u_{\varepsilon }^{\ast },y_{\varepsilon }^{\ast })$ of (P) converges as ε goes to 0 to a pair ( u, y) which realizes the minimum in (P), and y is the solution to the original state system. An alternative approach to the control problem is done by considering two controls related between them by a certain elliptic problem. This approach leads to the determination of simpler conditions of optimality, but under an additional restriction upon the initial data of the direct problem. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
41. On Dual Invex Ky Fan Inequalities.
- Author
-
Farajzadeh, A. and Noor, M.
- Subjects
- *
MATHEMATICAL inequalities , *INFINITE processes , *TOPOLOGY , *MATHEMATICS , *VECTOR spaces - Abstract
In this paper, we obtain some new results for the dual invex Ky Fan inequalities in topological vector spaces. These results can be viewed as an extension and refinement of the previously known results of Noor and others. [ABSTRACT FROM AUTHOR]
- Published
- 2010
- Full Text
- View/download PDF
42. Proximal-Point Algorithm Using a Linear Proximal Term.
- Author
-
He, B., Fu, X., and Jiang, Z.
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *MATHEMATICAL inequalities , *LAGRANGE equations , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
Proximal-point algorithms (PPAs) are classical solvers for convex optimization problems and monotone variational inequalities (VIs). The proximal term in existing PPAs usually is the gradient of a certain function. This paper presents a class of PPA-based methods for monotone VIs. For a given current point, a proximal point is obtained via solving a PPA-like subproblem whose proximal term is linear but may not be the gradient of any functions. The new iterate is updated via an additional slight calculation. Global convergence of the method is proved under the same mild assumptions as the original PPA. Finally, profiting from the less restrictions on the linear proximal terms, we propose some parallel splitting augmented Lagrangian methods for structured variational inequalities with separable operators. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
43. Linear Optimization with Box Constraints in Banach Spaces.
- Author
-
Sivakumar, K. and Swarna, J.
- Subjects
- *
MATHEMATICAL optimization , *BANACH spaces , *LINEAR operators , *LINEAR programming , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
Let X be a partially ordered real Banach space, let a, b∈ X with a≤ b. Let φ be a bounded linear functional on X. We say that X satisfies the box-optimization property (or X is a BOP space) if the box-constrained linear program: max 〈 φ, x〉, s.t. a≤ x≤ b, has an optimal solution for any φ, a and b. Such problems arise naturally in solving a class of problems known as interval linear programs. BOP spaces were introduced (in a different language) and systematically studied in the first author’s doctoral thesis. In this paper, we identify new classes of Banach spaces that are BOP spaces. We present also sufficient conditions under which answers are in the affirmative for the following questions: [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
44. Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization.
- Author
-
Andrei, N.
- Subjects
- *
MATHEMATICAL optimization , *ALGORITHMS , *STOCHASTIC convergence , *CONVEX functions , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
In this paper a new hybrid conjugate gradient algorithm is proposed and analyzed. The parameter β k is computed as a convex combination of the Polak-Ribière-Polyak and the Dai-Yuan conjugate gradient algorithms, i.e. β=(1− θ k) β+ θ k β. The parameter θ k in the convex combination is computed in such a way that the conjugacy condition is satisfied, independently of the line search. The line search uses the standard Wolfe conditions. The algorithm generates descent directions and when the iterates jam the directions satisfy the sufficient descent condition. Numerical comparisons with conjugate gradient algorithms using a set of 750 unconstrained optimization problems, some of them from the CUTE library, show that this hybrid computational scheme outperforms the known hybrid conjugate gradient algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
45. ε-Optimality and ε-Lagrangian Duality for a Nonconvex Programming Problem with an Infinite Number of Constraints.
- Author
-
Son, T., Strodiot, J., and Nguyen, V.
- Subjects
- *
LAGRANGE equations , *NONCONVEX programming , *BANACH spaces , *MATHEMATICAL programming , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
In this paper, ε-optimality conditions are given for a nonconvex programming problem which has an infinite number of constraints. The objective function and the constraint functions are supposed to be locally Lipschitz on a Banach space. In a first part, we introduce the concept of regular ε-solution and propose a generalization of the Karush-Kuhn-Tucker conditions. These conditions are up to ε and are obtained by weakening the classical complementarity conditions. Furthermore, they are satisfied without assuming any constraint qualification. Then, we prove that these conditions are also sufficient for ε-optimality when the constraints are convex and the objective function is ε-semiconvex. In a second part, we define quasisaddlepoints associated with an ε-Lagrangian functional and we investigate their relationships with the generalized KKT conditions. In particular, we formulate a Wolfe-type dual problem which allows us to present ε-duality theorems and relationships between the KKT conditions and regular ε-solutions for the dual. Finally, we apply these results to two important infinite programming problems: the cone-constrained convex problem and the semidefinite programming problem. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
46. Strong Convergence of Iterative Algorithms for Variational Inequalities in Banach Spaces.
- Author
-
Ceng, L., Schaible, S., and Yao, J.
- Subjects
- *
BANACH spaces , *STOCHASTIC convergence , *ALGORITHMS , *MATHEMATICAL inequalities , *MATHEMATICAL mappings , *MATHEMATICS - Abstract
Let C be a nonempty closed convex subset of a Banach space E with the dual E*, let T: C→ E* be a Lipschitz continuous mapping and let S: C→ C be a relatively nonexpansive mapping. In this paper, by employing the notion of generalized projection operator, we study the following variational inequality (for short, VI( T− f, C)): find x∈ C such that where f∈ E* is a given element. Utilizing the modified Ishikawa iteration and the modified Halpern iteration for relatively nonexpansive mappings, we propose two modified versions of J.L. Li’s (J. Math. Anal. Appl. 295:115–126, ) iterative algorithm for finding approximate solutions of VI( T− f, C). Moreover, it is proven that these iterative algorithms converge strongly to the same solution of VI( T− f, C), which is also a fixed point of S. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
47. Delay-Dependent Nonfragile H∞ Observer-Based Control for Neutral Systems with Time Delays in the State and Control Input.
- Author
-
Chen, J.
- Subjects
- *
TIME delay systems , *LYAPUNOV functions , *MATHEMATICAL inequalities , *COMPUTER software , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
The problem of the delay-dependent nonfragile H∞ observer-based control for a class of neutral systems with time delays is investigated. The additive gain variations under consideration are contained in both the controller gain and the observer gain. Novel delay-dependent criteria are derived to guarantee the stability of the nonfragile H∞ observer-based control system using the Lyapunov function approach combined with linear matrix inequalities (LMI). The controller and observer gains are given from the LMI feasible solutions. Based on the result of this paper, the constraint of matrix equality is not necessary for designing a nonfragile H∞ observer-based control. The computer software Matlab can be applied to solve the proposed problems. Finally, a numerical example is given illustrating the design of the nonfragile H∞ observer-based control. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
48. Extended Well-Posedness of Quasiconvex Vector Optimization Problems.
- Author
-
Crespi, G., Papalia, M., and Rocca, M.
- Subjects
- *
MATHEMATICAL optimization , *EQUATIONS , *CONVEX functions , *NUMERICAL analysis , *MATHEMATICAL analysis , *MATHEMATICS - Abstract
The notion of extended-well-posedness has been introduced by Zolezzi for scalar minimization problems and has been further generalized to vector minimization problems by Huang. In this paper, we study the extended well-posedness properties of vector minimization problems in which the objective function is C-quasiconvex. To achieve this task, we first study some stability properties of such problems. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
49. On the Analyticity of Underlying HKM Paths for Monotone Semidefinite Linear Complementarity Problems.
- Author
-
C. K. Sim
- Subjects
- *
LINEAR complementarity problem , *DIFFERENTIAL equations , *DUALITY theory (Mathematics) , *MATHEMATICAL optimization , *MATHEMATICS , *MATHEMATICAL analysis , *SYSTEM analysis - Abstract
An interior point method (IPM) defines a search direction at an interior point of the feasible region. These search directions form a direction field, which in turn defines a system of ordinary differential equations (ODEs). The solutions of the system of ODEs are called off-central paths, underlying paths lying in the interior of the feasible region. It is known that not all off-central paths are analytic, whether w.r.t. μ or $\sqrt{\mu}$ , where μ represents the duality gap, at a solution of a given semidefinite linear complementarity problem, SDLCP (Sim and Zhao, Math. Program. 110:475–499, ). In Sim and Zhao (J. Optim. Theory Appl. 137:11–25, ), we give a necessary and sufficient condition for when an off-central path is analytic as a function of $\sqrt{\mu}$ at a solution of a general SDLCP. It is then natural to ask about the analyticity of a SDLCP off-central path at a solution, as a function of μ. We investigate this in the current paper. Again, we work under the assumption that the given SDLCP satisfies strict complementarity condition. [ABSTRACT FROM AUTHOR]
- Published
- 2009
- Full Text
- View/download PDF
50. Duality for ε-Variational Inequality.
- Author
-
Kum, S., Kim, G. S., and Lee, G. M.
- Subjects
- *
DUALITY theory (Mathematics) , *MATHEMATICAL analysis , *MATHEMATICAL optimization , *MATHEMATICS , *ALGEBRA , *TOPOLOGY - Abstract
In this paper, following the method in the proof of the composition duality principle due to Robinson and using some basic properties of the ε-subdifferential and the conjugate function of a convex function, we establish duality results for an ε-variational inequality problem. Then, we give Fenchel duality results for the ε-optimal solution of an unconstrained convex optimization problem. Moreover, we present an example to illustrate our Fenchel duality results for the ε-optimal solutions. [ABSTRACT FROM AUTHOR]
- Published
- 2008
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.