Corpus ID: 237532558

Hilbert-Space Convex Optimization Utilizing Parallel Reduction of Linear Inequality to Equality Constraints

  title={Hilbert-Space Convex Optimization Utilizing Parallel Reduction of Linear Inequality to Equality Constraints},
  author={Ephraim Neimand and Serban Sabau},
We present a parallel optimization algorithm for a convex function f on a Hilbert space, H, under r ∈ N linear inequality constraints by finding optimal points over sets of equality constraints. Let ν(⋅) be the time complexity of some process, then given enough threads, and strict convexity, the complexity of our algorithm is O(r ⋅ ν(⟨⋅, ⋅⟩) ⋅ ν(minH f)). The method works on constrained spaces with empty interiors, furthermore no feasible point is required, and the algorithm recognizes when the… Expand


Convex Analysis and Monotone Operator Theory in Hilbert Spaces
This book provides a largely self-contained account of the main results of convex analysis and optimization in Hilbert space. A concise exposition of related constructive fixed point theory isExpand
A Universal Primal-Dual Convex Optimization Framework
A new primal-dual algorithmic framework for a prototypical constrained convex optimization template that does not require the objective function to be differentiable, and can also process additional general linear inclusion constraints, while guarantees the convergence rate on the primal problem. Expand
Closed-Form Expressions for Projectors onto Polyhedral Sets in Hilbert Spaces
The problem of finding the projection as a convex optimization problem is formulated and it is solved explicitly sufficient and necessary optimality conditions to solve the problem of projection onto a polyhedral set. Expand
An Infeasible-Start Framework for Convex Quadratic Optimization, with Application to Constraint-Reduced Interior-Point Methods
The framework is applied to a feasible-start constraint-reduced interior-point algorithm previously proved to be highly performant on problems with many more constraints than variables ("imbalanced"). Expand
Finding the orthogonal projection of a point onto an affine subspace
A simple method is proposed to find the orthogonal projection of a given point to the solution set of a system of linear equations. This is also a direct method for solving systems of linearExpand
Complexity of interior-point methods for linear optimization based on a new trigonometric kernel function
The worst case iteration bound for the large update primal-dual interior point methods is obtained as O ( n 2 3 log n ? ) which improves the so far obtained complexity results for the trigonometric kernel function significantly. Expand
Convex Optimization
A comprehensive introduction to the subject of convex optimization shows in detail how such problems can be solved numerically with great efficiency. Expand
Interior Point Methods for Nonlinear Optimization
After more than a decade of turbulent research, the IPM community reached a good understanding of the basics of IPMs and several books were published that summarize and explore different aspects of IPM's. Expand
Linear equalities in blackbox optimization
The main idea consists in reformulating the optimization problem into an equivalent problem without equalities and possibly fewer optimization variables, involving orthogonal projections, QR or SVD decompositions, as well as basic and nonbasic variables. Expand
Primal-Dual Interior-Point Methods
  • Stephen J. Wright
  • Mathematics, Computer Science
  • Other Titles in Applied Mathematics
  • 1997
This chapter discusses Primal Method Primal-Dual Methods, Path-Following Algorithm, and Infeasible-Interior-Point Algorithms, and their applications to Linear Programming and Interior-Point Methods. Expand