Suchergebnisse - mathematical optimization. approximation theory. interior programming. linear programming.

Robust Optimization von 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 …”
Volltext

Interior-Point Method for Nuclear Norm Approximation with Application to System Identification von 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 …”
Volltext

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

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

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

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

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

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

Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization von 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 …”
Volltext

Quasi-Newton approaches to interior point methods for quadratic problems von 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 …”
Volltext

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

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

Risk optimization with p-order conic constraints: A linear programming approach von 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 …”
Volltext

Decomposition Based Interior Point Methods for Two-Stage Stochastic Convex Quadratic Programs with Recourse von 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 …”
Volltext

Nonlinear robust optimization via sequential convex bilevel programming von 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 …”
Volltext

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

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

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

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

New Preconditioners Applied to Linear Programming and the Compressive Sensing Problems von 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 …”
Volltext

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

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

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

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

A diffusion-map-based algorithm for gradient computation on manifolds and applications von 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 …”
Volltext

Constraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problem von 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 …”
Volltext

An affine-scaling interior-point CBB method for box-constrained optimization von 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 …”
Volltext

A Class of Large-Update and Small-Update Primal-Dual Interior-Point Algorithms for Linear Optimization von 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 …”
Volltext