Lagrangian transformation and interior ellipsoid methods in convex optimization
From MaRDI portal
Publication:2342139
DOI10.1007/s10957-014-0527-5zbMath1330.90135MaRDI QIDQ2342139
Publication date: 11 May 2015
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-014-0527-5
convergence; interior point methods; augmented Lagrangian; Bregman distance; Lagrangian transformation
90C25: Convex programming
90C26: Nonconvex programming, global optimization
90C46: Optimality conditions and duality in mathematical programming
90C51: Interior-point methods
Related Items
Solving large-scale reactive optimal power flow problems by a primal-dual \(\mathrm{M}^2\mathrm{BF}\) approach, A primal-dual integrated nonlinear rescaling approach applied to the optimal reactive dispatch problem, Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables, The Legendre Transformation in Modern Optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A modification of Karmarkar's linear programming algorithm
- On the convergence of the exponential multiplier method for convex programming
- A new polynomial-time algorithm for linear programming
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- On the solution of large-scale SDP problems by the modified barrier method using iterative solvers
- A polynomial-time algorithm, based on Newton's method, for linear programming
- Modified barrier functions (theory and methods)
- Proximal minimization algorithm with \(D\)-functions
- Nonlinear rescaling and proximal-like methods in convex optimization
- Introductory lectures on convex optimization. A basic course.
- Interior-point methods
- Nonlinear rescaling vs. smoothing technique in convex optimization
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- Multiplier and gradient methods
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- A variation on Karmarkar’s algorithm for solving linear programming problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- A new family of penalties for augmented Lagrangian methods
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Penalty/Barrier Multiplier Methods for Convex Programming Problems
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- A dual approach to solving nonlinear programming problems by unconstrained optimization
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
- Primal–dual exterior point method for convex optimization
