A globally convergent Lagrangian barrier algorithm for optimization with general inequality constraints and simple bounds
From MaRDI portal
Publication:5691011
DOI10.1090/S0025-5718-97-00777-1zbMath0854.90125OpenAlexW2032756980MaRDI QIDQ5691011
Andrew R. Conn, Phillipe L. Toint, Nick I. M. Gould
Publication date: 9 January 1997
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-97-00777-1
Related Items
Adjoint-based surrogate optimization of oil reservoir water flooding, A method combining genetic algorithm with simultaneous perturbation stochastic approximation for linearly constrained stochastic optimization problems, A note on exploiting structure when using slack variables, Probabilistic model identification of uncertainties in computational models for dynamical systems and experimental validation, Operations research methods for estimating the population size of neuron types, A practical approach to optimization, Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization, Dislocation hyperbolic augmented Lagrangian algorithm for nonconvex optimization, Gradient surfing: a new deterministic approach for low-dimensional global optimization, An exact penalty-Lagrangian approach for large-scale nonlinear programming, A primal-dual modified log-barrier method for inequality constrained nonlinear optimization, Identification of Elastic Orthotropic Material Parameters by the Singular Boundary Method, A resolução do problema de despacho ótimo de reativos pelo método da função lagrangiana-barreira relaxada, Parameter recovery for the leaky competing accumulator model, Nonlinear output constraints handling for production optimization of oil reservoirs, A novel high-order functional based image registration model with inequality constraint, On using exterior penalty approaches for solving linear programming problems, Intensity modulated radiotherapy treatment planning by use of a barrier-penalty multiplier method, Predicting single spikes and spike patterns with the Hindmarsh-Rose model, A Shifted Primal-Dual Penalty-Barrier Method for Nonlinear Optimization, Control analysis and design via randomised coordinate polynomial minimisation
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
- A new polynomial-time algorithm for linear programming
- Introduction to sensitivity and stability analysis in nonlinear programming
- Theoretical efficiency of a shifted-barrier-function algorithm for linear programming
- Computational experience with a primal-dual interior point method for linear programming
- Convergence properties of trust region methods for linear and convex constraints
- Modified barrier functions (theory and methods)
- Degeneracy in interior point methods for linear programming: A survey
- A note on using alternative second-order models for the subproblems arising in barrier function methods for minimization
- A note on exploiting structure when using slack variables
- On the number of inner iterations per outer iteration of a globally convergent algorithm for optimization with general nonlinear inequality constraints and simple bounds
- Computational experience with penalty-barrier methods for nonlinear programming
- Multiplier and gradient methods
- Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Projected gradient methods for linearly constrained problems
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables
- On the Identification of Active Constraints
- Correction to the Paper on Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds
- A modified barrier function method with improved rate of convergence for degenerate problems
- Convergence bounds for nonlinear programming algorithms
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Barrier Method for Large-Scale Constrained Optimization
- The convergence of a modified barrier method for convex programming
- A Practical Interior-Point Method for Convex Programming
