An interior-point algorithm for nonconvex nonlinear programming
From MaRDI portal
Publication:1294828
DOI10.1023/A:1008677427361zbMath1040.90564OpenAlexW1508335918MaRDI QIDQ1294828
David F. Shanno, Robert J. Vanderbei
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
Nonlinear programming (90C30) Interior-point methods (90C51) Methods of successive quadratic programming type (90C55)
Related Items
Fast projected gradient method for support vector machines, A modified differential evolution based solution technique for economic dispatch problems, A new framework for the computation of Hessians, Computation of projection regression depth and its induced median, Case studies in optimization: catenary problem, Effective reformulations of the truss topology design problem, Interior-point solver for large-scale quadratic programming problems with bound constraints, Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming, An interior-point algorithm for solving inverse linear optimization problem, The Convex Feasible Set Algorithm for Real Time Optimization in Motion Planning, A truncated Newton method in an augmented Lagrangian framework for nonlinear programming, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, An inexact Newton method for nonconvex equality constrained optimization, Best practices for comparing optimization algorithms, On central-path proximity measures in interior-point methods, Primal-dual nonlinear rescaling method for convex optimization, Application of lower bound direct method to engineering structures, Interior-point algorithms, penalty methods and equilibrium problems, Inner solvers for interior point methods for large scale nonlinear programming, A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm, A penalty-interior-point algorithm for nonlinear constrained optimization, Nonlinear rescaling as interior quadratic prox method in convex optimization, An interior point method for nonlinear programming with infeasibility detection capabilities, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, DrAmpl: A meta solver for optimization problem analysis, A note on the use of vector barrier parameters for interior-point methods, Learning to steer nonlinear interior-point methods, Theory and applications of optimal control problems with multiple time-delays, Newton-KKT interior-point methods for indefinite quadratic programming, Solving linear optimal control problems of the time-delayed systems by Adomian decomposition method, An interior-point implementation developed and tuned for radiation therapy treatment planning, An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization, An SR1/BFGS SQP algorithm for nonconvex nonlinear programs with block-diagonal Hessian matrix, Unnamed Item, An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness, A heuristic algorithm for a chance constrained stochastic program, Interior point methods 25 years later, Free material optimization for stress constraints, A non-interior implicit smoothing approach to complementarity problems for frictionless contacts, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Interior-point methods for nonconvex nonlinear programming: cubic regularization, An augmented Lagrangian filter method, On formation of security portfolio with uniform distribution by logarithmic criterion and priority risk component, On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm, The flattened aggregate constraint homotopy method for nonlinear programming problems with many nonlinear constraints, Optimization techniques for tree-structured nonlinear problems, Design of optimal PID controller with \(\epsilon\)-Routh stability for different processes, Global convergence of slanting filter methods for nonlinear programming, Steplength selection in interior-point methods for quadratic programming, Study of a primal-dual algorithm for equality constrained minimization, A Chebyshev technique for the solution of optimal control problems with nonlinear programming methods, Some iterative methods for the solution of a symmetric indefinite KKT system, An SQP-type algorithm for nonlinear second-order cone programs, Cubic regularization in symmetric rank-1 quasi-Newton methods, A local convergence property of primal-dual methods for nonlinear programming, An adaptively regularized sequential quadratic programming method for equality constrained optimization, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, Efficient formulations for pricing under attraction demand models, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, An interior-point algorithm for nonlinear minimax problems, A scalable algorithm for MAP estimators in Bayesian inverse problems with Besov priors, Numerical experiments with an inexact Jacobian trust-region algorithm, On the solution of NP-hard linear complementarity problems, An interior-point piecewise linear penalty method for nonlinear programming, A starting point strategy for nonlinear interior methods., Optimization problems with equilibrium constraints and their numerical solution., On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, An efficient method for nonlinearly constrained networks, An interior algorithm for nonlinear optimization that combines line search and trust region steps, Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties, Detecting and approximating fault lines from randomly scattered data, Examples of ill-behaved central paths in convex optimization, Interior-point methods for the phase-field approach to brittle and ductile fracture, Mesh shape-quality optimization using the inverse mean-ratio metric, Solving discretized degenerate optimal control problems with state constraints, Approximate solution of system of equations arising in interior-point methods for bound-constrained optimization, Generalized convexity in multiple view geometry, A radial boundary intersection aided interior point method for multi-objective optimization, Dynamic updates of the barrier parameter in primal-dual methods for nonlinear programming, TACO: a toolkit for AMPL control optimization, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, Object Library of Algorithms for Dynamic Optimization Problems: Benchmarking SQP and Nonlinear Interior Point Methods, Mixed integer nonlinear programming using interior-point methods, An infeasible interior-point arc-search algorithm for nonlinear constrained optimization, A Riemannian Newton trust-region method for fitting Gaussian mixture models, Designing polymer spin packs by tailored shape optimization techniques, A Newton-like method for nonlinear system of equations, Interior point filter method for semi-infinite programming problems, Solving elliptic control problems with interior point and SQP methods: Control and state constraints, A primal-dual interior-point algorithm for nonlinear least squares constrained problems, Globally convergent interior-point algorithm for nonlinear programming, Global convergence analysis of line search interior-point methods for nonlinear programming without regularity assumptions, An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems, Sequential quadratic programming for large-scale nonlinear optimization, A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs, From global to local convergence of interior methods for nonlinear optimization, Global convergence enhancement of classical linesearch interior point methods for MCPs, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs, An interior method for nonconvex semidefinite programs, Unnamed Item, A primal–dual penalty method via rounded weighted-ℓ1 Lagrangian duality, A globally convergent regularized interior point method for constrained optimization, A dual active-set proximal Newton algorithm for sparse approximation of correlation matrices, An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, Numerically efficient and robust Interior-point algorithm for finite strain rate-independent crystal plasticity, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, A spline smoothing homotopy method for nonlinear programming problems with both inequality and equality constraints, An overview of nonlinear optimization, A Distributed Interior-Point KKT Solver for Multistage Stochastic Optimization, Globally Solving Nonconvex Quadratic Programs via Linear Integer Programming Techniques, Optimization-based approach to path planning for closed chain robot systems, Interior point methods for large-scale nonlinear programming, A quasi-Newton interior point method for semi-infinite programming, Very large scale optimization by sequential convex programming, Trust-region interior-point method for large sparsel1optimization, Free material optimization: recent progress†, FORCES NLP: an efficient implementation of interior-point methods for multistage nonlinear nonconvex programs, Practical implementation of an interior point nonmonotone line search filter method, A globally convergent primal-dual interior-point relaxation method for nonlinear programs, Challenges in Enterprise Wide Optimization for the Process Industries, A feasible direction algorithm for nonlinear second-order cone programs, LOQO:an interior point code for quadratic programming, LOQO user's manual — version 3.10, Practical Direct Collocation Methods for Computational Optimal Control, Non-conforming Localized Model Reduction with Online Enrichment: Towards Optimal Complexity in PDE Constrained Optimization, A central path interior point method for nonlinear programming and its local convergence
Uses Software
