Keyword: programming: convex

Found 402 papers in total
A Scheme for Computing Minimum Covers within Simple Regions
A Scheme for Computing Minimum Covers within Simple Regions
2012,
Let X be a simple region (e.g., a simple polygon), and let Q be a set of points in X ....
Aligning Two Convex Figures to Minimize Area or Perimeter
Aligning Two Convex Figures to Minimize Area or Perimeter
2012,
Given two compact convex sets P and Q in the plane, we consider the problem of finding...
Fitting piecewise linear continuous functions
Fitting piecewise linear continuous functions
2012,
We consider the problem of fitting a continuous piecewise linear function to a finite...
On safe tractable approximations of chance constraints
On safe tractable approximations of chance constraints
2012,
A natural way to handle optimization problem with data affected by stochastic...
Worst‐Case Violation of Sampled Convex Programs for Optimization with Uncertainty
Worst‐Case Violation of Sampled Convex Programs for Optimization with Uncertainty
2012,
A deterministic approach called robust optimization has been recently proposed to deal...
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
An Algorithm for Computing a Convex and Simple Path of Bounded Curvature in a Simple Polygon
2002,
In this paper we study the collision-free path planning problem for a point robot,...
Implementing the Nelder‐Mead simplex algorithm with adaptive parameters
Implementing the Nelder‐Mead simplex algorithm with adaptive parameters
2012,
In this paper, we first prove that the expansion and contraction steps of the...
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
On the effectiveness of projection methods for convex feasibility problems with linear inequality constraints
2012,
The effectiveness of projection methods for solving systems of linear inequalities is...
Generating equidistant representations in biobjective programming
Generating equidistant representations in biobjective programming
2012,
In recent years, emphasis has been placed on generating quality representations of the...
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
A trust region algorithm with adaptive cubic regularization methods for nonsmooth convex minimization
2012,
By using the Moreau‐Yosida regularization and proximal method, a new trust...
Proximal‐like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods
Proximal‐like contraction methods for monotone variational inequalities in a unified framework I: Effective quadruplet and primary methods
2012,
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches...
Proximal‐like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments
Proximal‐like contraction methods for monotone variational inequalities in a unified framework II: general methods and numerical experiments
2012,
Approximate proximal point algorithms (abbreviated as APPAs) are classical approaches...
The complexity of VLSI power‐delay optimization by interconnect resizing
The complexity of VLSI power‐delay optimization by interconnect resizing
2012,
The lithography used for 32 nanometers and smaller VLSI process technologies restricts...
Design of H-∞ fuzzy controllers for nonlinear systems with random data dropouts
Design of H-∞ fuzzy controllers for nonlinear systems with random data dropouts
2011,
The problem of H- ∞ control of nonlinear networked control systems subject to...
Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown
Asymptotically optimal interruptible service policies for scheduling jobs in a diffusion regime with nondegenerate slowdown
2011,
A parallel server system is considered, with I customer classes and many servers,...
Inexact Halpern‐type proximal point algorithm
Inexact Halpern‐type proximal point algorithm
2011,
We present several strong convergence results for the modified, Halpern‐type,...
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It
2011,
Recent results showing PPAD‐completeness of the problem of computing an...
On solving Linear Complementarity Problems by DC programming and DCA
On solving Linear Complementarity Problems by DC programming and DCA
2011,
In this paper, we consider four optimization models for solving the Linear...
A projected–gradient interior–point algorithm for complementarity problems
A projected–gradient interior–point algorithm for complementarity problems
2011,
Interior–point algorithms are among the most efficient techniques for solving...
Finding multiple optimal solutions of signomial discrete programming problems with free variables
Finding multiple optimal solutions of signomial discrete programming problems with free variables
2011,
With the increasing reliance on mathematical programming based approaches in various...
A feasible directions method for nonsmooth convex optimization
A feasible directions method for nonsmooth convex optimization
2011,
We propose a new technique for minimization of convex functions not necessarily...
Optimization of Supply Chain Systems with Price Elasticity of Demand
Optimization of Supply Chain Systems with Price Elasticity of Demand
2011,
A centralized multiechelon, multiproduct supply chain network is presented in a...
Optimal coalition formation and surplus distribution: Two sides of one coin
Optimal coalition formation and surplus distribution: Two sides of one coin
2011,
A fuzzy coalitional game represents a situation in which players can vary the...
Optimal value bounds in nonlinear programming with interval data
Optimal value bounds in nonlinear programming with interval data
2011,
We consider nonlinear programming problems the input data of which are not fixed, but...
Papers per page: