A method of sequential log-convex programming for engineering design
From MaRDI portal
Publication:6050371
DOI10.1007/s11081-022-09750-3arXiv2201.08436WikidataQ114224226 ScholiaQ114224226MaRDI QIDQ6050371
Publication date: 18 September 2023
Published in: Optimization and Engineering (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.08436
sequential quadratic programmingnonlinear programminglog-convexitygeometric programmingsequential convex programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A sequential quadratically constrained quadratic programming method with an augmented Lagrangian line search function
- A tutorial on geometric programming
- Handbook of test problems in local and global optimization
- A QCQP-based splitting SQP algorithm for two-block nonconvex constrained optimization problems with application
- Disciplined geometric programming
- Optimization of biochemical systems through mathematical programming: methods and applications
- The Solution of the Chemical Equilibrium Programming Problem with Generalized Benders Decomposition
- A Superlinearly Convergent Sequential Quadratically Constrained Quadratic Programming Algorithm for Degenerate Nonlinear Programming
- Mathematical Programming Models for Environmental Quality Control
- Engineering Design Optimization
- A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization
- Digital Circuit Optimization via Geometric Programming
- Optimal Resource Allocation for Network Protection Against Spreading Processes
- Optimal Compression in Natural Gas Networks: A Geometric Programming Approach
- Geometric Programming for Communication Systems
This page was built for publication: A method of sequential log-convex programming for engineering design