An interior-point trust-funnel algorithm for nonlinear optimization
From MaRDI portal
Publication:507313
DOI10.1007/S10107-016-1003-9zbMATH Open1355.65075DBLPjournals/mp/CurtisGRT17OpenAlexW2333358170WikidataQ58185646 ScholiaQ58185646MaRDI QIDQ507313FDOQ507313
Authors: Frank E. Curtis, Nicholas I. M. Gould, Daniel P. Robinson, Philippe L. Toint 
Publication date: 3 February 2017
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://purl.org/net/epubs/work/11292235
Recommendations
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- A trust region method based on interior point techniques for nonlinear programming.
- An interior trust region algorithm for solving linearly constrained nonlinear optimization
- A derivative-free trust-funnel method for equality-constrained nonlinear optimization
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Cites Work
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- LOQO:an interior point code for quadratic programming
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- On the Implementation of a Primal-Dual Interior Point Method
- A new polynomial-time algorithm for linear programming
- Practical methods of optimization.
- Interior point methods 25 years later
- Trust Region Methods
- Title not available (Why is that?)
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- An interior-point algorithm for large-scale nonlinear optimization with inexact step computations
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
- Nonlinear programming without a penalty function or a filter
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- On the Implementation of an Algorithm for Large-Scale Equality Constrained Optimization
- On solving trust-region and other regularised subproblems in optimization
- A sequential quadratic programming algorithm with an additional equality constrained phase
- A primal-dual trust region algorithm for nonlinear optimization
- A second derivative SQP method: global convergence
- A second derivative SQP method: local convergence and practical issues
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- A second-derivative SQP method with a `trust-region-free' predictor step
- Solving symmetric indefinite systems in an interior-point method for linear programming
- Superlinear and quadratic convergence of some primal - dual interior point methods for constrained optimization
- A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- An Inexact SQP Method for Equality Constrained Optimization
- Q-SUPERLINEAR CONVERGENCE OF PRIMAL-DUAL INTERIOR POINT QUASI-NEWTON METHODS FOR CONSTRAINED OPTIMIZATION
- Using a Massively Parallel Processor to Solve Large Sparse Linear Programs by an Interior-Point Method
- On the global convergence of a modified augmented Lagrangian linesearch interior-point Newton method for nonlinear programming
Cited In (10)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- A local MM subspace method for solving constrained variational problems in image recovery
- Numerical experience with a derivative-free trust-funnel method for nonlinear optimization problems with general nonlinear constraints
- An interior point method for nonlinear optimization with a quasi-tangential subproblem
- A nonmonotone filter SQP method: local convergence and numerical results
- Recent advances in trust region algorithms
- Convergence of a stabilized SQP method for equality constrained optimization
- On the componentwise boundedness away from zero of iterates generated by stabilized interior point methods
- A direct discretization recurrent neurodynamics method for time-variant nonlinear optimization with redundant robot manipulators
- Complexity analysis of a trust funnel algorithm for equality constrained optimization
Uses Software
This page was built for publication: An interior-point trust-funnel algorithm for nonlinear optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q507313)
