Necessary and sufficient optimality conditions for two-stage stochastic programming problems
Necessary conditions for discrete dynamical systems with delays and general constraints
Necessary conditions for vector optimization in infinite dimension
In the paper we present second-order necessary conditions for constrained vector optimization problems in infinite-dimensional spaces. In this way we generalize some corresponding results obtained earlier.
Necessary optimality conditions for discrete systems with state-dependent control region
New algorithms for maximization of concave functions with box constraints
New concepts in nondifferentiable programming
New convergence results on an algorithm for norm constrained regularization and related problems
New hybrid conjugate gradient method for nonlinear optimization with application to image restoration problems
The conjugate gradient method is one of the most effective algorithm for unconstrained nonlinear optimization problems. This is due to the fact that it does not need a lot of storage memory and its simple structure properties, which motivate us to propose a new hybrid conjugate gradient method through a convex combination of and . We compute the convex parameter using the Newton direction. Global convergence is established through the strong Wolfe conditions. Numerical experiments show the...
New regions of stability in input optimization
using point-to-set mappings we identify two new regions of stability in input optimization. Then we extend various results from the literature on optimality conditions, continuity of Lagrange multipliers, and the marginal value formula over the new and some old regions of stability.
New technique for solving univariate global optimization
In this paper, a new global optimization method is proposed for an optimization problem with twice differentiable objective function a single variable with box constraint. The method employs a difference of linear interpolant of the objective and a concave function, where the former is a continuous piecewise convex quadratic function underestimator. The main objectives of this research are to determine the value of the lower bound that does not need an iterative local optimizer. The proposed method...
Newton methods for solving two classes of nonsmooth equations
The paper is devoted to two systems of nonsmooth equations. One is the system of equations of max-type functions and the other is the system of equations of smooth compositions of max-type functions. The Newton and approximate Newton methods for these two systems are proposed. The Q-superlinear convergence of the Newton methods and the Q-linear convergence of the approximate Newton methods are established. The present methods can be more easily implemented than the previous ones, since they do not...
Newton's Method for Nonlinear Inequalities.
Nonlinear conjugate gradient methods
Modifications of nonlinear conjugate gradient method are described and tested.
Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization.
Nonlinear Duality And Multiplier Theorems.
Nonlinear iterative methods and parallel computation
Nonlinear optimization using the generalized reduced gradient method
Non-linear programming and the maximum principle for discrete time optimal control problems
Nonlinear Rescaling Method and Self-concordant Functions
Nonlinear rescaling is a tool for solving large-scale nonlinear programming problems. The primal-dual nonlinear rescaling method was used to solve two quadratic programming problems with quadratic constraints. Based on the performance of primal-dual nonlinear rescaling method on testing problems, the conclusions about setting up the parameters are made. Next, the connection between nonlinear rescaling methods and self-concordant functions is discussed and modified logarithmic barrier function is...
Nonsmooth equation method for nonlinear nonconvex optimization
The contribution deals with the description of two nonsmooth equation methods for inequality constrained mathematical programming problems. Three algorithms are presented and their efficiency is demonstrated by numerical experiments.