Interior Point Methods for Nonlinear Optimization
From MaRDI portal
Publication:3569506
DOI10.1007/978-3-642-11339-0_4zbMath1251.90391OpenAlexW132901562MaRDI QIDQ3569506
Publication date: 21 June 2010
Published in: Lecture Notes in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-11339-0_4
Interior-point methods (90C51) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items
On strong duality in linear copositive programming, Facial reduction algorithms for conic optimization problems, An exact explicit dual for the linear copositive programming problem, Invariance Conditions for Nonlinear Dynamical Systems, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, TPFA Finite Volume Approximation of Wasserstein Gradient Flows, Modeling approaches for addressing unrelaxable bound constraints with unconstrained optimization methods, Amenable cones: error bounds without constraint qualifications, A nonlinear model for stage-structured population dynamics with nonlocal density-dependent regulation: an application to the fall armyworm moth, Computation of optimal transport with finite volumes, Complementarity enhanced Nash's mappings and differentiable homotopy methods to select perfect equilibria
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving semidefinite-quadratic-linear programs using SDPT3
- A new polynomial-time algorithm for linear programming
- Further development of multiple centrality correctors for interior point methods
- Geometric algorithms and combinatorial optimization
- A computational study of the homogeneous algorithm for large-scale convex optimization
- Sensitivity analysis in linear programming: Just be careful!
- An interior point method, based on rank-1 updates, for linear programming
- Warm start of the primal-dual method applied in the cutting-plane scheme
- Finding an interior point in the optimal face of linear programs
- Interior point methods of mathematical programming
- On the complexity of semidefinite programs
- Volumetric path following algorithms for linear programming
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Second-order cone programming
- Avoiding numerical cancellation in the interior point method for solving semidefinite programs
- A product-form Cholesky factorization method for handling dense columns in interior point methods for linear programming
- On a homogeneous algorithm for the monotone complementarity problem
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Pivot versus interior point methods: Pros and cons
- Product-form Cholesky factorization in interior point methods for second-order cone programming
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- Large step volumetric potential reduction algorithms for linear programming
- Interior-point methods for nonlinear complementarity problems
- A new algorithm for minimizing convex functions over convex sets
- A general parametric analysis approach and its implication to sensitivity analysis in interior point methods
- Implementation of a primal-dual method for SDP on a shared memory parallel architecture
- How good are interior point methods? Klee-Minty cubes tighten iteration-complexity bounds
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the behavior of the homogeneous self-dual model for conic convex optimization
- Lectures on Modern Convex Optimization
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Warm-Start Strategies in Interior-Point Methods for Linear Programming
- On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0
- Graph Implementations for Nonsmooth Convex Programs
- Linear Inequalities and Related Systems. (AM-38)
- A New Unblocking Technique to Warmstart Interior Point Methods Based on Sensitivity Analysis
- Parallel implementation of a semidefinite programming solver based on CSDP on a distributed memory cluster
- Interior-point methods for optimization
- Solving Real-World Linear Programs: A Decade and More of Progress
- On Minimizing the Maximum Eigenvalue of a Symmetric Matrix
- Cones of Matrices and Set-Functions and 0–1 Optimization
- On the Implementation of a Primal-Dual Interior Point Method
- An Implementation of a Primal-Dual Interior Point Method for Linear Programming
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
- On homogeneous interrior-point algorithms for semidefinite programming
- Implementation of interior point methods for mixed semidefinite and second order cone optimization problems
- A study of search directions in primal-dual interior-point methods for semidefinite programming
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Conic convex programming and self-dual embedding
- Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- The theory of linear programming:skew symmetric self-dual problems and the central path*
- Interior Methods for Nonlinear Optimization
- The interior-point revolution in optimization: History, recent developments, and lasting consequences
- Semidefinite Programming
- An Interior Point Method for Mathematical Programs with Complementarity Constraints (MPCCs)
- Interior Point Methods for Linear Optimization
- Parallel Processing and Applied Mathematics
- Handbook of semidefinite programming. Theory, algorithms, and applications
- An easy way to teach interior-point methods.
- New complexity analysis of the primal-dual Newton method for linear optimization
