Keyword: programming: convex

Found 402 papers in total
On the Problem of Minimizing a Difference of Polyhedral Convex Functions Under Linear Constraints
On the Problem of Minimizing a Difference of Polyhedral Convex Functions Under Linear Constraints
2016,
This paper is concerned with two d.p. (difference of polyhedral convex functions)...
Uniform Estimation of a Convex Body by a Fixed-Radius Ball
Uniform Estimation of a Convex Body by a Fixed-Radius Ball
2016,
The paper deals with a finite‐dimensional problem of finding a uniform estimate...
Second-Order Minimization Method for Nonsmooth Functions Allowing Convex Quadratic Approximations of the Augment
Second-Order Minimization Method for Nonsmooth Functions Allowing Convex Quadratic Approximations of the Augment
2016,
Second‐order methods play an important role in the theory of optimization. Due...
Optimality Condition for Local Efficient Solutions of Vector Equilibrium Problems via Convexificators and Applications
Optimality Condition for Local Efficient Solutions of Vector Equilibrium Problems via Convexificators and Applications
2016,
Fritz John and Karush–Kuhn–Tucker necessary conditions for local efficient...
Reduced Pairs of Compact Convex Sets and Ordered Median Functions
Reduced Pairs of Compact Convex Sets and Ordered Median Functions
2016,
We prove that in finite dimensional spaces every ordered median function is the...
Duality for Nonsmooth Optimization Problems with Equilibrium Constraints, Using Convexificators
Duality for Nonsmooth Optimization Problems with Equilibrium Constraints, Using Convexificators
2016,
In this paper, we consider optimization problems with equilibrium constraints. We...
Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions
Chebyshev Approximation by Linear Combinations of Fixed Knot Polynomial Splines with Weighting Functions
2016,
In this paper, we derive conditions for best uniform approximation by fixed knots...
New Augmented Lagrangian-Based Proximal Point Algorithm for Convex Optimization with Equality Constraints
New Augmented Lagrangian-Based Proximal Point Algorithm for Convex Optimization with Equality Constraints
2016,
The augmented Lagrangian method is a classic and efficient method for solving...
Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle
Stochastic Intermediate Gradient Method for Convex Problems with Stochastic Inexact Oracle
2016,
In this paper, we introduce new methods for convex optimization problems with...
On Benson’s scalarization in multiobjective optimization
On Benson’s scalarization in multiobjective optimization
2016,
In this paper, a popular scalarization problem in multiobjective optimization,...
A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths
A convex relaxation for the time-optimal trajectory planning of robotic manipulators along predetermined geometric paths
2016,
In this paper, we deal with the problem of time‐optimal trajectory planning and...
Convex Relaxations for Gas Expansion Planning
Convex Relaxations for Gas Expansion Planning
2016,
Expansion of natural gas networks is a critical process involving substantial capital...
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems
2016,
Despite the significant attention they have drawn, big‐bucket lot‐sizing...
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
Solution of Monotone Complementarity and General Convex Programming Problems Using a Modified Potential Reduction Interior Point Method
2017,
We present a homogeneous algorithm equipped with a modified potential function for the...
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
Up- and downgrading the euclidean 1-median problem and knapsack Voronoi diagrams
2016,
We consider the 1‐median problem with euclidean distances with uncertainty in...
An interactive approach for biobjective integer programs under quasiconvex preference functions
An interactive approach for biobjective integer programs under quasiconvex preference functions
2016,
We develop an interactive algorithm for biobjective integer programs that finds the...
A multiobjective interval goal programming method using penalty function
A multiobjective interval goal programming method using penalty function
2016,
This article demonstrates how the penalty function can efficiently be used for solving...
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
Constrained incremental bundle method with partial inexact oracle for nonsmooth convex semi-infinite programming problems
2016,
Semi‐infinite problem (SIPs) are widely used in many control systems for...
On how to solve large-scale log-determinant optimization problems
On how to solve large-scale log-determinant optimization problems
2016,
We propose a proximal augmented Lagrangian method and a hybrid method, i.e., employing...
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints
2016,
In this paper we consider a class of separable convex optimization problems with...
Local convex hulls for a special class of integer multicommodity flow problems
Local convex hulls for a special class of integer multicommodity flow problems
2016,
Based on previous work in rolling stock scheduling problems (Alfieri et al. in Transp...
On Slater’s condition and finite convergence of the Douglas‐Rachford algorithm for solving convex feasibility problems in Euclidean spaces
On Slater’s condition and finite convergence of the Douglas‐Rachford algorithm for solving convex feasibility problems in Euclidean spaces
2016,
The Douglas–Rachford algorithm is a classical and very successful method for...
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
A relaxed-projection splitting algorithm for variational inequalities in Hilbert spaces
2016,
We introduce a relaxed‐projection splitting algorithm for solving variational...
Differentiability Properties of Metric Projections onto Convex Sets
Differentiability Properties of Metric Projections onto Convex Sets
2016,
It is known that directional differentiability of metric projection onto a closed...
Papers per page: