Interior-point methods for optimization
From MaRDI portal
Publication:3612043
DOI10.1017/S0962492906370018zbMath1160.65027OpenAlexW2124488712WikidataQ57392910 ScholiaQ57392910MaRDI QIDQ3612043
Michael J. Todd, Arkadi Nemirovski
Publication date: 3 March 2009
Published in: Acta Numerica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0962492906370018
convex programminginterior point methodsglobal polynomial optimizationnon-convex nonlinear optimization.
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Interior-point methods (90C51)
Related Items
A unified mathematical programming formulation of strain driven and interior point algorithms for shakedown and limit analysis, A Hybrid Proximal Extragradient Self-Concordant Primal Barrier Method for Monotone Variational Inequalities, Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions, New computational methods for classification problems in the existence of outliers based on conic quadratic optimization, Path Counting for Grid-Based Navigation, Linear optimization over homogeneous matrix cones, Complex portfolio selection via convex mixed‐integer quadratic programming: a survey, Unnamed Item, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, Optimal Learning in Linear Regression with Combinatorial Feature Selection, Enhancing phenomenological yield functions with data: challenges and opportunities, An extension of Chubanov's algorithm to symmetric cones, Complex-demand scheduling problem with application in smart grid, Study of a primal-dual algorithm for equality constrained minimization, Active Vibration Reduction System Optimal Control Using Linear Matrix Inequalities with No Directional Change in Controls, Interior Point Methods for Nonlinear Optimization, A self-concordant exponential kernel function for primal–dual interior-point algorithm, A Schwarz lemma for Kähler affine metrics and the canonical potential of a proper convex cone, Greedy approaches for a class of nonlinear generalized assignment problems, Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts, A Single-Phase, Proximal Path-Following Framework, Random variables with moment-matching staircase density functions, Unnamed Item, Book Review: The basic George B. Dantzig, Estimation in the partially nonlinear model by continuous optimization, Unnamed Item
Uses Software
Cites Work
- Introductory lectures on convex optimization. A basic course.
- Infeasible-start primal-dual methods and infeasibility detectors for nonlinear programming problems
- Hyperbolic Polynomials and Convex Analysis
- A Mathematical View of Interior-Point Methods in Convex Optimization
- Lectures on Modern Convex Optimization
- Linear Matrix Inequalities in System and Control Theory
- Handbook of semidefinite programming. Theory, algorithms, and applications
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
