Feasible direction interior-point technique for nonlinear optimization
From MaRDI portal
Publication:1273166
DOI10.1023/A:1021752227797zbMath0911.90303OpenAlexW125730541MaRDI QIDQ1273166
Publication date: 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021752227797
interior-point algorithmsnonlinear constrained optimizationsmooth functionquasi-Newton algorithmsfeasible direction approach
Related Items (35)
Numerical solution of a class of moving boundary problems with a nonlinear complementarity approach ⋮ Lower bound limit analysis using non-linear programming ⋮ Numerical simulation of the forest impact on aquifers ⋮ Topographical global initialization for finding all solutions of nonlinear systems with constraints ⋮ Application of the sequential parametric convex approximation method to the design of robust trusses ⋮ Primal-dual interior point QP-free algorithm for nonlinear constrained optimization ⋮ A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics ⋮ The inverse electromagnetic shaping problem ⋮ Damping optimization of viscoelastic laminated sandwich composite structures ⋮ An optimization approach for unconfined seepage problem with semipermeable conditions ⋮ Inductor shape optimization for electromagnetic casting ⋮ A feasible directions method for nonsmooth convex optimization ⋮ A comparative analysis of contact algorithms in contact shape optimization problems ⋮ An interior point algorithm for mixed complementarity nonlinear problems ⋮ An interior point technique for solving bilevel programming problems ⋮ A nonlinear programming algorithm for finite element limit analysis using feasible arc searching technique ⋮ Fractional Derivatives Applied to Epidemiology ⋮ Limited memory interior point bundle method for large inequality constrained nonsmooth minimization ⋮ A hybrid epigraph directions method for nonsmooth and nonconvex constrained optimization via generalized augmented Lagrangian duality and a genetic algorithm ⋮ A control problem arising in the process of waste water purification ⋮ Interior epigraph directions method for nonsmooth and nonconvex optimization via generalized augmented Lagrangian duality ⋮ Numerical Procedure for Calibration of Volatility with American Options ⋮ VOLATILITY SMILE BY MULTILEVEL LEAST SQUARE ⋮ An adaptive competitive penalty method for nonsmooth constrained optimization ⋮ A simplicial homology algorithm for Lipschitz optimisation ⋮ Globally convergent cutting plane method for nonconvex nonsmooth minimization ⋮ Mathematical programming approach for unconfined seepage flow problem ⋮ Newton-type methods: a broader view ⋮ Mathematical programming models and algorithms for engineering design optimization ⋮ A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization ⋮ Some Applications of Optimal Control Theory of Distributed Systems ⋮ Visco-piezo-elastic parameter estimation in laminated plate structures ⋮ Parameter estimation in active plate structures using gradient optimisation and neural networks ⋮ A feasible direction algorithm for nonlinear second-order cone programs ⋮ MULTIDIMENSIONAL CALIBRATION OF CRUDE OIL AND REFINED PRODUCTS VIA SEMIDEFINITE PROGRAMMING TECHNIQUES
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Test examples for nonlinear programming codes
- Optimization theory application to slitted plate bending problems
- An interior point potential reduction method for constrained equations
- On the formulation and theory of the Newton interior-point method for nonlinear programming
- An iterative algorithm for limit analysis with nonlinear yield functions
- A Polynomial-Time Primal-Dual Affine Scaling Algorithm for Linear and Convex Quadratic Programming and Its Power Series Extension
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- A Superlinearly Convergent Feasible Method for the Solution of Inequality Constrained Optimization Problems
- A QP-Free, Globally Convergent, Locally Superlinearly Convergent Algorithm for Inequality Constrained Optimization
- Feasible directions algorithms for optimization problems with equality and inequality constraints
- A quasi-Newton interior point algorithm applied to constrained optimum design in computational fluid dynamics
This page was built for publication: Feasible direction interior-point technique for nonlinear optimization
