Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Keyword: programming: convex
Found
402 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Subgradient Projection Algorithms and Approximate Solutions of Convex Feasibility Problems
2013,
Zaslavski A
In the present paper, we use subgradient projection algorithms for solving convex...
On robust design optimization of truss structures with bounded uncertainties
2013,
Bai Song
This paper investigates robust design optimization of truss structures with...
Symmetry properties in structural optimization: some extensions
2013,
Cheng Gengdong
In the present paper, some extensions of the previous theoretical results about the...
Optimality conditions in convex optimization revisited
2013,
Dutta Joydeep
The phrase convex optimization refers to the minimization of a convex function over a...
Ideal representations of lexicographic orderings and base‐2 expansions of integer variables
2013,
Sherali Hanif D
We use minimal cover and set covering inequalities to define the convex hulls of...
On integer polytopes with few nonzero vertices
2013,
Toth Paolo
We provide a simple description in terms of linear inequalities of the convex hull of...
Convex Approximations of a Probabilistic Bicriteria Model with Disruptions
2013,
Morton David P
We consider a multiperiod system operation problem with two conflicting objectives,...
Some constraint qualifications for quasiconvex vector‐valued systems
2013,
Suzuki Satoshi
In this paper, we consider minimization problems with a quasiconvex...
Asymptotic analysis in convex composite multiobjective optimization problems
2013,
Chen Zhe
In this paper, we present a unified approach for studying convex composite...
Characterizations of the nonemptiness and compactness for solution sets of convex set‐valued optimization problems
2013,
Huang X
In this paper, we first derive several characterizations of the nonemptiness and...
Abstract convexity of radiant functions with applications
2013,
Mohebi H
In this paper, we investigate abstract convexity of non‐positive increasing and...
The Whole Random Optimization with Application
2013,
Hu Chuan-Gan
On an open or a finitely open subset of a Fréchet space into a Fréchet...
Fixed Point and Equilibrium Theorems in a Generalized Convexity Framework
2013,
Patriche Monica
We study the fixed point property of set‐valued maps and the existence of...
Adjoint Coexhausters in Nonsmooth Analysis and Extremality Conditions
2013,
Abbasov M
In the classical (‘smooth’) mathematical analysis, a differentiable...
Convex and Concave Relaxations for the Parametric Solutions of Semi‐explicit Index‐One Differential‐Algebraic Equations
2013,
Barton Paul
A method is presented for computing convex and concave relaxations of the parametric...
The Hemivariational Inequalities for an Upper Semicontinuous Set‐valued Mapping
2013,
He Y
We establish some existence results for hemivariational inequalities of Stampacchia...
Duality and Farkas‐type results for extended Ky Fan inequalities with DC functions
2013,
Sun X
In this paper, we deal with extended Ky Fan inequalities (EKFI) with DC functions....
Conjugate gradient type methods for the nondifferentiable convex minimization
2013,
Li Qiong
We proposed implementable conjugate gradient type methods for solving a possibly...
A generalized proximal point algorithmfor the nonlinear complementarity problem
1999,
Iusem Alfredo N
We consider a generalized proximal point method (GPPA) for solving the nonlinear...
Generalized weak sharp minima in cone‐constrained convex optimization with applications
2012,
Huang X
In this paper, we consider convex optimization problems with cone constraints (CPC in...
Common fixed points of an infinite family of nonexpansive mappings in uniformly convex metric spaces
2013,
Phuengrattana Withun
We generalize the notion of K ‐mapping due to Kangtunyakarn and Suantai (2009)...
A class of quasi‐variational inequalities for adaptive image denoising and decomposition
2013,
Lenzen Frank
We introduce a class of adaptive non‐smooth convex variational problems for...
An ADM‐based splitting method for separable convex programming
2013,
Han Deren
We consider the convex minimization problem with linear constraints and a...
A double smoothing technique for solving unconstrained nondifferentiable convex optimization problems
2013,
Boţ Radu Ioan
The aim of this paper is to develop an efficient algorithm for solving a class of...
First Page
4
5
6
7
8
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers