An interior-point algorithm for nonconvex nonlinear programming
From MaRDI portal
Publication:1294828
DOI10.1023/A:1008677427361zbMATH Open1040.90564OpenAlexW1508335918MaRDI QIDQ1294828FDOQ1294828
Authors: Robert J. Vanderbei, David F. Shanno 
Publication date: 1999
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1008677427361
Recommendations
Methods of successive quadratic programming type (90C55) Nonlinear programming (90C30) Interior-point methods (90C51)
Cited In (only showing first 100 items - show all)
- An affine scaling interior point backtracking algorithm for nonlinear constrained optimisation
- Efficient formulations for pricing under attraction demand models
- Title not available (Why is that?)
- Global convergence of slanting filter methods for nonlinear programming
- An interior-point algorithm for nonlinear minimax problems
- A new framework for the computation of Hessians
- A primal-dual interior-point algorithm for nonlinear least squares constrained problems
- Theory and applications of optimal control problems with multiple time-delays
- Title not available (Why is that?)
- Numerical experiments with an inexact Jacobian trust-region algorithm
- Interior point methods 25 years later
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- A non-interior implicit smoothing approach to complementarity problems for frictionless contacts
- A note on the use of vector barrier parameters for interior-point methods
- Object library of algorithms for dynamic optimization problems: benchmarking SQP and nonlinear interior point methods
- An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts
- On the solution of NP-hard linear complementarity problems
- Title not available (Why is that?)
- Primal interior-point method for large sparse minimax optimization
- A local convergence property of primal-dual methods for nonlinear programming
- Numerical experiments with an interior-exterior point method for nonlinear programming
- An inexact Newton method for nonconvex equality constrained optimization
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Primal-dual nonlinear rescaling method with dynamic scaling parameter update
- From global to local convergence of interior methods for nonlinear optimization
- On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm
- A penalty-interior-point algorithm for nonlinear constrained optimization
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Interior point filter method for semi-infinite programming problems
- On some efficient interior point methods for nonlinear convex programming
- Interior-point methods for nonconvex nonlinear programming: orderings and higher-order methods
- LOQO user's manual — version 3.10
- Optimization problems with equilibrium constraints and their numerical solution.
- An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
- Challenges in Enterprise Wide Optimization for the Process Industries
- A feasible BFGS interior point algorithm for solving convex minimization problems
- Nonlinear rescaling as interior quadratic prox method in convex optimization
- Newton-KKT interior-point methods for indefinite quadratic programming
- Free material optimization for stress constraints
- Free material optimization: recent progress†
- LOQO:an interior point code for quadratic programming
- A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties
- Interior-point methods for nonconvex nonlinear programming: cubic regularization
- On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component
- Primal-dual nonlinear rescaling method for convex optimization
- Interior Point Methods for Nonlinear Optimization
- Optimization-based approach to path planning for closed chain robot systems
- An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
- An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming
- On central-path proximity measures in interior-point methods
- Examples of ill-behaved central paths in convex optimization
- Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes
- Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques
- Interior-point algorithms, penalty methods and equilibrium problems
- DrAmpl: A meta solver for optimization problem analysis
- The method of sequential affine gradient project interior-point for nonlinear programming
- An efficient method for nonlinearly constrained networks
- Study of a primal-dual algorithm for equality constrained minimization
- Application of lower bound direct method to engineering structures
- TACO: a toolkit for AMPL control optimization
- A truncated Newton method in an augmented Lagrangian framework for nonlinear programming
- Mixed integer nonlinear programming using interior-point methods
- Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming
- Very large scale optimization by sequential convex programming
- An interior method for nonconvex semidefinite programs
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- An interior-point piecewise linear penalty method for nonlinear programming
- An SQP-type algorithm for nonlinear second-order cone programs
- Global convergence enhancement of classical linesearch interior point methods for MCPs
- A Newton-like method for nonlinear system of equations
- An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix
- A heuristic algorithm for a chance constrained stochastic program
- Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- An interior-point \(\ell_1\)-penalty method for nonlinear optimization
- A quasi-Newton interior point method for semi-infinite programming
- Generalized convexity in multiple view geometry
- On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
- Effective reformulations of the truss topology design problem
- The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints
- Solving discretized degenerate optimal control problems with state constraints
- An infeasible interior-point arc-search algorithm for nonlinear constrained optimization
- Title not available (Why is that?)
- A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs
- Optimization techniques for tree-structured nonlinear problems
- Some iterative methods for the solution of a symmetric indefinite KKT system
- Computation of projection regression depth and its induced median
- Case studies in optimization: catenary problem
- Inner solvers for interior point methods for large scale nonlinear programming
- FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs
- Cubic regularization in symmetric rank-1 quasi-Newton methods
- An interior-point algorithm for solving inverse linear optimization problem
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Solving elliptic control problems with interior point and SQP methods: Control and state constraints
- A radial boundary intersection aided interior point method for multi-objective optimization
- Practical implementation of an interior point nonmonotone line search filter method
- A globally convergent primal-dual interior-point relaxation method for nonlinear programs
Uses Software
This page was built for publication: An interior-point algorithm for nonconvex nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294828)
