Keyword: programming: convex

Found 402 papers in total
Robust reliable guaranteed cost control for uncertain T-S fuzzy neutral systems with interval time-varying delay and linear fractional perturbations
Robust reliable guaranteed cost control for uncertain T-S fuzzy neutral systems with interval time-varying delay and linear fractional perturbations
2015,
The robust reliable guaranteed cost control for Takagi–Sugeno fuzzy systems with...
A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions
A new partial splitting augmented Lagrangian method for minimizing the sum of three convex functions
2013,
In this paper, we propose a new partial splitting augmented Lagrangian method for...
Sufficiency and duality for multiobjective variational control problems with G-invexity
Sufficiency and duality for multiobjective variational control problems with G-invexity
2012,
Antczak introduced vector‐valued G ‐invex functions in 2009, which is a...
Rhoades type fixed point theorems for two hybrid pairs of mappings in metrically convex spaces
Rhoades type fixed point theorems for two hybrid pairs of mappings in metrically convex spaces
2012,
The present paper establishes some common fixed point theorems for two hybrid pairs of...
Default probabilities of a holding company, with complete and partial information
Default probabilities of a holding company, with complete and partial information
2014,
This paper studies the valuation of credit risk for firms that own several...
Convergence of a general algorithm of asymptotically nonexpansive maps in uniformly convex hyperbolic spaces
Convergence of a general algorithm of asymptotically nonexpansive maps in uniformly convex hyperbolic spaces
2014,
In this paper, we establish convergence theorems for a general algorithm of an...
Computing the region of convergence for power series in many real variables: A ratio-like test
Computing the region of convergence for power series in many real variables: A ratio-like test
2011,
We give an elementary proof that the region of convergence for a power series in many...
A modified Polak‐Ribière‐Polyak conjugate gradient algorithm for nonsmooth convex programs
A modified Polak‐Ribière‐Polyak conjugate gradient algorithm for nonsmooth convex programs
2014,
The conjugate gradient (CG) method is one of the most popular methods for solving...
A convex optimization method to solve a filter design problem
A convex optimization method to solve a filter design problem
2014,
In this paper, we formulate the feasibility problem corresponding to a filter design...
Conditional gradient Tikhonov method for a convex optimization problem in image restoration
Conditional gradient Tikhonov method for a convex optimization problem in image restoration
2014,
In this paper, we consider the problem of image restoration with Tikhonov...
Quasi-Newton’s method for multiobjective optimization
Quasi-Newton’s method for multiobjective optimization
2014,
In this paper we present a quasi‐Newton’s method for unconstrained...
B-splines methods with redefined basis functions for solving fourth order parabolic partial differential equations
B-splines methods with redefined basis functions for solving fourth order parabolic partial differential equations
2011,
In this work, we discuss two methods for solving a fourth order parabolic partial...
A DC programming approach for planning a multisensor multizone search for a target
A DC programming approach for planning a multisensor multizone search for a target
2014,
In this paper, we consider a well‐known problem in the general area of search...
A note on iterative process for G 2-multi degree reduction of Bézier curves
A note on iterative process for G 2-multi degree reduction of Bézier curves
2012,
In the paper [A. Rababah, S. Mann, Iterative process for G 2 ‐multi degree...
Method of conjugate subgradients with constrained memory
Method of conjugate subgradients with constrained memory
2014,
A method to solve the convex problems of nondifferentiable optimization relying on the...
On reduction of the two-stage problem of quantile optimization to the problem of convex programming
On reduction of the two-stage problem of quantile optimization to the problem of convex programming
2014,
Consideration was given to the two‐stage problem of stochastic programming with...
Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities
Optimality Conditions and Characterizations of the Solution Sets in Generalized Convex Problems and Variational Inequalities
2013,
We derive necessary and sufficient conditions for optimality of a problem with a...
Continuous location of an assembly station
Continuous location of an assembly station
2013,
Demand existing at client points in the plane for several products should be met....
Convex analytic approach to constrained discounted Markov decision processes with non‐constant discount factors
Convex analytic approach to constrained discounted Markov decision processes with non‐constant discount factors
2013,
In this paper we develop the convex analytic approach to a discounted...
A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
A nonmonotone approximate sequence algorithm for unconstrained nonlinear optimization
2014,
A new nonmonotone algorithm is proposed and analyzed for unconstrained nonlinear...
Certification aspects of the fast gradient method for solving the dual of parametric convex programs
Certification aspects of the fast gradient method for solving the dual of parametric convex programs
2013,
This paper examines the computational complexity certification of the fast gradient...
Global behavior of a two‐dimensional competitive system of difference equations with stocking
Global behavior of a two‐dimensional competitive system of difference equations with stocking
2012,
We investigate the global dynamics of solutions of competitive rational systems of...
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large‐scale separable convex optimization problems
Combining Lagrangian decomposition and excessive gap smoothing technique for solving large‐scale separable convex optimization problems
2013,
A new algorithm for solving large‐scale convex optimization problems with a...
An Inexact Accelerated Proximal Gradient Method and a Dual Newton‐CG Method for the Maximal Entropy Problem
An Inexact Accelerated Proximal Gradient Method and a Dual Newton‐CG Method for the Maximal Entropy Problem
2013,
This paper describes an algorithm to solve large‐scale maximal entropy...
Papers per page: