Search Results - mathematical optimization. approximation theory. interior programming. linear programming.~

Robust Optimization by Ben-Tal, Aharon, El Ghaoui, Laurent, Nemirovski, Arkadi

“…Robust optimization is still a relatively new approach to optimization problems affected by uncertainty, but it has already proved so useful in real applications that it is difficult to tackle…”
Get full text

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification by Liu, Zhang, Vandenberghe, Lieven

“… This problem can be formulated as a semidefinite program, but the reformulation requires large auxiliary matrix variables, and is expensive to solve by general-purpose interior-point solvers…”
Get full text

A Polynomial Arc-Search Interior-Point Algorithm for Linear Programming by Yang, Yaguang

“…In this paper, ellipsoidal estimations are used to track the central path of linear programming…”
Get full text

A primal–dual interior point method for nonlinear semidefinite programming by Yamashita, Hiroshi, Yabe, Hiroshi, Harada, Kouhei

“…This paper is concerned with a primal–dual interior point method for solving nonlinear semidefinite programming problems…”
Get full text

A wide neighborhood infeasible-interior-point method with arc-search for linear programming by Yang, Ximei, Zhang, Yinkui, Liu, Hongwei

“…In this paper, we propose an arc-search infeasible-interior-point method for linear programming…”
Get full text

Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization by Zeilinger, M. N., Jones, C. N., Morari, M.

“… The algorithm computes a piecewise affine approximation of the optimal solution that is used to warm-start an active set linear programming procedure…”
Get full text

Quasi-Newton approaches to interior point methods for quadratic problems by Gondzio, J., Sobral, F. N. C.

“… Solving the linear systems which arise from this approach is the most computationally expensive task of an interior point iteration. If, due…”
Get full text

Copositive Programming via Semi-Infinite Optimization by Ahmed, Faizan, Dür, Mirjam, Still, Georg

“…Copositive programming (CP) can be regarded as a special instance of linear semi-infinite programming (SIP…”
Get full text

Risk optimization with p-order conic constraints: A linear programming approach by Krokhmal, Pavlo A., Soberanis, Policarpio

“…The paper considers solving of linear programming problems with p-order conic constraints that are related to a certain class of stochastic optimization models with risk objective or constraints…”
Get full text

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse by Mehrotra, Sanjay, Ozevin, M. Gokhan

“…Zhao showed that the log barrier associated with the recourse function of two-stage stochastic linear programs behaves as a strongly self-concordant barrier and forms a self-concordant family…”
Get full text

Nonlinear robust optimization via sequential convex bilevel programming by Houska, Boris, Diehl, Moritz

“…–max problems which arise in the context of semi-infinite programming. Here, our main motivation are nonlinear inequality constrained robust optimization problems…”
Get full text

On Hazan’s Algorithm for Symmetric Programming Problems by Faybusovich, Leonid

“…We describe the generalization of Hazan’s algorithm for symmetric programming problems…”
Get full text

Exploiting special structure in semidefinite programming: A survey of theory and applications by Klerk, Etienne de

“…Semidefinite programming (SDP) may be seen as a generalization of linear programming (LP…”
Get full text

New Preconditioners Applied to Linear Programming and the Compressive Sensing Problems by Kikuchi, Paula A., Oliveira, Aurelio R. L.

“… In the first approach, we consider the interior point methods that are very efficient for solving linear programming problems…”
Get full text

A preconditioning technique for Schur complement systems arising in stochastic optimization by Petra, Cosmin G., Anitescu, Mihai

“…Deterministic sample average approximations of stochastic programming problems with recourse are suitable for a scenario-based parallelization…”
Get full text

New developments in the primal–dual column generation technique by Gondzio, Jacek, González-Brevis, Pablo, Munari, Pedro

“…► New developments in theory and applications of the primal–dual column generation…”
Get full text

A diffusion-map-based algorithm for gradient computation on manifolds and applications by Gomez, Alvaro Almeida, Silva Neto, Antonio J., Zubelli, Jorge P.

“…We present a technique to estimate the Riemannian gradient of a given function defined on interior points of a Riemannian submanifold in the Euclidean space based on a sample of function evaluations…”
Get full text

Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem by Engau, Alexander, Anjos, Miguel F., Bomze, Immanuel

“…, and computational chemistry. While some relaxations provide high-quality bounds, they result in very large and expensive conic optimization problems…”
Get full text

An affine-scaling interior-point CBB method for box-constrained optimization by Hager, William W., Mair, Bernard A., Zhang, Hongchao

“…) gradient iterate that lies in the interior of the feasible set. Global convergence is established for a nonmonotone line search, while there is local R-linear…”
Get full text

A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization by Bai, Y. Q., Lesaja, G., Roos, C., Wang, G. Q., El Ghami, M.

“…In this paper we present a class of polynomial primal-dual interior-point algorithms for linear optimization based on a new class of kernel functions…”
Get full text