Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming

DOI10.1111/ITOR.12736MaRDI QIDQ6090468zbMATH OpenOpenAlexWikidataFDO

Authors Zvi Drezner, Pawel Kalczynski

Publication date 17 November 2023

Published in International Transactions in Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1111/itor.12736

zbMATH Keywords

heuristic proceduresnonconvex optimizationsequential linear programs

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites work

• A heuristic for the circle packing problem with a variety of containers
• A parallel variable neighborhood search approach for the obnoxious p‐median problem
• Calculation of the move limits for the sequential linear programming method
• Comparison of iterative searches for the quadratic assignment problem
• Computational efficiency of improved move limit method of sequential linear programming for structural optimization
• Exact algorithms for the solution of the grey pattern quadratic assignment problem
• Finding a cluster of points and the grey pattern quadratic assignment problem
• scientific article; zbMATH DE number 780774 (Why is no real title available?)
• scientific article; zbMATH DE number 5060482 (Why is no real title available?)
• Less is more approach: basic variable neighborhood search for the obnoxious p‐median problem
• Location of Multiple Obnoxious Facilities
• Minimum weight design of trusses using improved move limit method of sequential linear programming
• More optimal packings of equal circles in a square
• New approaches to circle packing in a square. With program codes.
• New Methods in Mathematical Programming—On Varying All the Parameters in a Linear-Programming Problem and Sequential Solution of a Linear-Programming Problem
• New results in the packing of equal circles in a square
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Packing equal circles in a square: A deterministic global optimization approach
• SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
• Solving the Continuous p-Dispersion Problem Using Non-linear Programming
• The minimum weighted covering location problem with distance constraints
• The multifacility maximin planar location problem with facility interaction
• The obnoxious p facility network location problem with facility interaction
• The Weber obnoxious facility location model: a big arc small arc approach

Cited in

(7)

• Extremely non-convex optimization problems: the case of the multiple obnoxious facilities location
• Review of obnoxious facilities location problems
• A sequential convex program approach to an inverse linear semidefinite programming problem
• The repeated p-dispersion problem
• A new approach to the multiple obnoxious facility location problem based on combinatorial and continuous tools
• Norm-induced cuts: outer approximation for Lipschitzian constraint functions
• Simultaneous convexification for the planar obnoxious facility location problem

This page was built for publication: Solving nonconvex nonlinear programs with reverse convex constraints by sequential linear programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6090468)