Results 251 to 260 of about 327,426 (292)

Interior Proximal Method Without the Cutting Plane Property

Journal of Optimization Theory and Applications, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Cutting Plane Method for Solving Quasimonotone Variational Inequalities

Computational Optimization and Applications, 2001
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Marcotte, P., Zhu, D. L.
openaire   +1 more source

Globally Convergent Cutting Plane Method for Nonconvex Nonsmooth Minimization

Journal of Optimization Theory and Applications, 2010
The authors propose an algorithm for solving nonsmooth nonconvex unconstrained programming problems together with some convergence results. This algorithm generates a sequence of interior points of the epigraph of the objective function whose accumulation points are stationary points of the original problem, and so, in case the objective is convex ...
Karmitsa, Napsu, Tanaka Filho, Mario, Herskovits, José   +2 more
openaire   +1 more source

Cutting Plane Method for Continuously Constrained Kernel-Based Regression

IEEE Transactions on Neural Networks, 2010
Incorporating constraints into the kernel-based regression is an effective means to improve regression performance. Nevertheless, in many applications, the constraints are continuous with respect to some parameters so that computational difficulties arise. Discretizing the constraints is a reasonable solution for these difficulties.
Zhe, Sun, Zengke, Zhang, Huangang, Wang, Min, Jiang   +3 more
openaire   +2 more sources

Accelerating the Cutting Plane Method for Nonlinear Programming

Journal of the Society for Industrial and Applied Mathematics, 1961
The “cutting plane” method of Kelley for nonlinear programming problems applies linear programming, through a sequence of local linearizations, to the problem of minimizing a convex function of real variables subject to linear inequality constraints.
openaire   +1 more source

Distributed Cutting Plane Method via Sample Point Consensus

IEEE Transactions on Automatic Control
This paper considers a general setup for the constrained convex optimisation problem over jointly-fully connected time-varying networks. We propose a novel cutting plane-based method that embeds a proximity-based consensus scheme for solving this (potentially non-smooth) optimisation problem.
Tianyi Zhong, David Angeli
openaire   +2 more sources

A cutting plane method for knapsack polytope

Journal of Computer and Systems Sciences International, 2009
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +1 more source

On Improvements to the Analytic Center Cutting Plane Method

Computational Optimization and Applications, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
du Merle, O., Goffin, J.-L., Vial, J.-P.
openaire   +1 more source

On Vaidya's Volumetric Cutting Plane Method for Convex Programming

Mathematics of Operations Research, 1997
We describe a simplified and strengthened version of Vaidya's volumetric cutting plane method for finding a point in a convex set 𝒞 ⊂ Rn. At each step the algorithm has a system of linear inequality constraints which defines a polyhedron 𝒫 ⊃ 𝒞, and an interior point x ∈ 𝒫.
openaire   +2 more sources

Bundle Methods, Cutting-Plane Algorithms and σ-Newton Directions

1985
Recently Lemarechal and Zowe [7] have introduced a theoretical second-order model for minimizing a real, not necessarily differentiable, convex function defined on]Rn. This model approximates the convex function f along any fixed direction d and is based on the variation with respect to a of the perturbed directional derivative f σ ′ (x,d) (all ...
Lemaréchal, Claude, Strodiot, Jean-Jacques   +1 more
openaire   +2 more sources