An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
DOI10.1007/S13675-015-0039-6zbMATH Open1329.90144OpenAlexW746623371MaRDI QIDQ904955FDOQ904955
Authors: Martin Schmidt 
Publication date: 14 January 2016
Published in: EURO Journal on Computational Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s13675-015-0039-6
Recommendations
- Limited memory interior point bundle method for large inequality constrained nonsmooth minimization
- scientific article; zbMATH DE number 1217580
- On the possibility of applying smooth methods to the solution of non- smooth optimization problems
- scientific article; zbMATH DE number 2152996
- Interior Point Methods for Nonlinear Optimization
interior-point methodsbarrier methodsgas network optimizationnonlinear and nonsmooth optimizationclassification of optimization modelsline-search methods
Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90) Deterministic network models in operations research (90B10) Nonlinear programming (90C30) Interior-point methods (90C51) Derivative-free methods and methods using generalized derivatives (90C56)
Cites Work
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the Implementation of a Primal-Dual Interior Point Method
- Benchmarking optimization software with performance profiles.
- A new polynomial-time algorithm for linear programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Methods of descent for nondifferentiable optimization
- Nonlinear optimization.
- Title not available (Why is that?)
- Title not available (Why is that?)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization
- Title not available (Why is that?)
- A trust region method based on interior point techniques for nonlinear programming.
- Nonlinear programming without a penalty function.
- Title not available (Why is that?)
- Interior Methods for Nonlinear Optimization
- An interior algorithm for nonlinear optimization that combines line search and trust region steps
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- Using Piecewise Linear Functions for Solving MINLPs
- A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
- Validation of nominations in gas network optimization: models, methods, and solutions
- Evaluating Gas Network Capacities
- An interior-point algorithm for nonconvex nonlinear programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Failure of global convergence for a class of interior point methods for nonlinear programming
- Adaptive Barrier Update Strategies for Nonlinear Interior Methods
- High detail stationary optimization models for gas networks
- A primal heuristic for nonsmooth mixed integer nonlinear optimization
- Chapter 12: Computational results for validation of nominations
Cited In (3)
Uses Software
This page was built for publication: An interior-point method for nonlinear optimization problems with locatable and separable nonsmoothness
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q904955)
