Results 71 to 80 of about 166 (143)

Using the Primal Dual Infeasible Newton Method in the Analytic Center Method for Problems Defined by Deep Cutting Planes.

, 1998
The convergence and the complexity of a primal-dual column generation and cutting plane algorithm from approximate analytic centers for solving convex feasibility problems defined by a "deep cut" separation oracle is studied.
Faranak Sharifi-Mokhtarian, Jean-louis Goffin   +1 more
core  

On the convergence properties of the projected gradient method for convex optimization

, 2008
. When applied to an unconstrained minimization problem with a convex objective, the steepest descent method has stronger convergence properties than in the noncovex case: the whole sequence converges to an optimal solution under the only hypothesis of ...
A. N. Iusem
core  

A forward-backward penalty scheme with inertial effects for monotone inclusions. Applications to convex bilevel programming. [PDF]

Optimization, 2019
Boţ RI, Nguyen DK.
europepmc   +1 more source

Robust network design in telecommunications under polytope demand uncertainty

We consider a model for robust network design in telecommunications, in which we minimize the cost of the maximum mismatch between supply and demand. In the present study, the demand is uncertain and takes its values in a polytope defined by constraints.
Lemaréchal, Claude, Petrou, Georgios, Ouorou, Adam   +2 more
core  

Characterization of the Barrier Parameter of Homogeneous Convex Cones

, 1995
We characterize the barrier parameter of the optimal self--concordant barriers for homogeneous cones. In particular, we prove that for homogeneous convex cones this parameter is the same as the rank of the corresponding Siegel domain.
Osman Güler, Levent Tunçel
core  

Convex Relaxations Of 0-1 Quadratic Programming

, 1993
We consider three parametric relaxations of the 0-1 quadratic programming problem. These relaxations are to: quadratic maximization over simple box constraints, quadratic maximization over the sphere, and the maximum eigenvalue of a bordered matrix. When
Svatopluk Poljak, Henry Wolkowicz
core  

Fast Reflected Forward-Backward algorithm: achieving fast convergence rates for convex optimization with linear cone constraints. [PDF]

J Sci Comput
Boţ RI, Nguyen DK, Zong C.
europepmc   +1 more source

A cyclic iterative method for solving multiple sets split feasibility problems in Banach spaces

, 2016
In this paper, we construct an iterative scheme and prove strong convergence theorem of the sequence generated to an approximate solution to a multiple sets split feasibility problem in a p-uniformly convex and uniformly smooth real Banach space.
Shehu, Y, Iyiola, O.S.
core  

Second Order Dynamics Featuring Tikhonov Regularization and Time Scaling. [PDF]

J Optim Theory Appl
Csetnek ER, Karapetyants MA.
europepmc   +1 more source

A Newton Barrier method for Minimizing a Sum of Euclidean Norms subject to linear equality constraints

, 1995
An algorithm for minimizing a sum of Euclidean Norms subject to linear equality constraints is described. The algorithm is based on a recently developed Newton barrier method for the unconstrained minimization of a sum of Euclidean norms (MSN ).
Edmund Christiansen, Knud D. Andersen
core