An Algorithm for Separable Nonconvex Programming Problems
From MaRDI portal
Publication:5558786
Recommendations
- A branch and bound algorithm for solving separable convex integer programming problems
- On nonconvex optimization problems with separated nonconvex variables
- scientific article; zbMATH DE number 2146951
- An algorithmic framework for MINLP with separable non-convexity
- scientific article; zbMATH DE number 713582
Cited in
(only showing first 100 items - show all)- Algorithms for parametric nonconvex programming
- A parallel algorithm for partially separable non-convex global minimization: Linear constraints
- Separable concave minimization via partial outer approximation and branch and bound
- Global optimization of bounded factorable functions with discontinuities
- An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives
- Convergent upper bounds in global minimization with nonlinear equality constraints
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Tabu search applied to the general fixed charge problem
- New dual-type decomposition algorithm for non-convex separable optimization problems
- Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
- Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems
- Reachability analysis and deterministic global optimization of DAE models
- Dual toll pricing for hazardous materials transport with linear delay
- An algorithm for optimizing network flow capacity under economies of scale
- On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
- Deterministic global optimization of steam cycles using the IAPWS-IF97 model
- An algorithm for nonconvex programming problems
- An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Optimization of a long-short portfolio under nonconvex transaction cost
- A general purpose exact solution method for mixed integer concave minimization problems
- A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
- scientific article; zbMATH DE number 1292040 (Why is no real title available?)
- On the convergence of two branch-and-bound algorithms for nonconvex programming problems
- Global search algorithms for minimum concave-cost network flow problems
- Variations and extension of the convex-concave procedure
- A fast memoryless interval-based algorithm for global optimization
- Construction of the convex hulls of functions for the branch-and-bound method
- Biconvex sets and optimization with biconvex functions: a survey and extensions
- A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
- Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
- scientific article; zbMATH DE number 4070220 (Why is no real title available?)
- Subdivision of simplices relative to a cutting plane and finite concave minimization
- An algorithm for indefinite integer quadratic programming
- On some optimization problems under uncertainty
- Extended reverse-convex programming: an approximate enumeration approach to global optimization
- An all-linear programming relaxation algorithm for optimizing over the efficient set
- Optimal deviations from an asset allocation.
- Global optimization of nonconvex problems with multilinear intermediates
- A convergent simplicial algorithm with -subdivision and -bisection strategies
- A modified simplicial algorithm for convex maximization based on an extension of \(\omega \)-subdivision
- Convex and concave relaxations of implicit functions
- Global optimization using special ordered sets
- Deletion-by-infeasibility rule for DC-constrained global optimization
- An interval branch and bound algorithm for global optimization of a multiperiod pricing model
- On the global minimization of concave functions
- Global optimization algorithms for linearly constrained indefinite quadratic problems
- On the nonlinear multilevel programming problems
- Minimizing a sum of staircase functions under linear constraints
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
- Algorithms for solving a separable problem of discrete optimization
- A branch and reduce approach for solving a class of low rank d.c. programs
- A branch and bound network approach to the canonical constrained entropy problem
- A continuous approch for globally solving linearly constrained quadratic
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- COMPARISON BETWEEN FIVE MINLP SOLVERS AND NEW RESULTS RELATED TO TRIGONOMETRIC FUNCTIONS
- A weighting method for 0-1 indefinite quadratic bilevel programming
- On convergence of the simplicial branch-and-bound algorithm based on \(\omega\)-subdivisions
- Convergence qualification of adaptive partition algorithms in global optimization
- Global solution of non-convex quadratically constrained quadratic programs
- Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
- Preface
- Second-order sensitivity analysis in factorable programming: Theory and applications
- A combined cutting-stock and lot-sizing problem
- Progress payments in project scheduling problems.
- Calculation of bounds on variables satisfying nonlinear inequality constraints
- Linear multiplicative programming
- A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
- Fair transfer price and inventory holding policies in two-enterprise supply chains
- Interval branch and bound with local sampling for constrained global optimization
- Sufficient optimality criterion for linearly constrained, separable concave minimization problems
- Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience
- Global optimization
- New Partitioning Method for a Class of Nonconvex Optimization Problems
- Cold supply chain design with environmental considerations: a simulation-optimization approach
- MINIMAL COST INDEX TRACKING UNDER NONLINEAR TRANSACTION COSTS AND MINIMAL TRANSACTION UNIT CONSTRAINTS
- A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
- The Shortest Path Interdiction Problem with Randomized Interdiction Strategies: Complexity and Algorithms
- Generalized bilinear programming. I: Models, applications and linear programming relaxation
- A fast algorithm for globally solving Tikhonov regularized total least squares problem
- A branch-and-bound algorithm embedded with DCA for DC programming
- scientific article; zbMATH DE number 3904344 (Why is no real title available?)
- Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand
- Global optimization of linear hybrid systems with explicit transitions
- Existence and sum decomposition of vertex polyhedral convex envelopes
- The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
- The cluster problem revisited
- Solving highly nonlinear convex separable programs using successive approximation
- Decomposition methods for solving nonconvex quadratic programs via branch and bound
- A branch-and-reduce approach to global optimization
- LP-form inclusion functions for global optimization
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
- A note on adapting methods for continuous global optimization to the discrete case
- A revision of the rectangular algorithm for a class of DC optimization problems
- Deterministic global optimization in ab-initio quantum chemistry
- A practical but rigorous approach to sum-of-ratios optimization in geometric applications
- Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
This page was built for publication: An Algorithm for Separable Nonconvex Programming Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5558786)
