An Algorithm for Separable Nonconvex Programming Problems

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)

Branch-and-price-and-cut algorithms for solving the reliable \(h\)-paths problem
On optimal zero-preserving corrections for inconsistent linear systems
A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
The polyadic structure of factorable function tensors with applications to high-order minimization techniques
Solving highly nonlinear convex separable programs using successive approximation
Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
On some optimization problems under uncertainty
On consistency of bounding operations in deterministic global optimization
Second-order sensitivity analysis in factorable programming: Theory and applications
Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems
Reversed geometric programming: A branch-and-bound method involving linear subproblems
On the convergence of two branch-and-bound algorithms for nonconvex programming problems
Algorithms for parametric nonconvex programming
Membership functions, some mathematical programming models and production scheduling
LP-form inclusion functions for global optimization
Effect of the subdivision strategy on convergence and efficiency of some global optimization algorithms
An all-linear programming relaxation algorithm for optimizing over the efficient set
Two algorithms for maximizing a separable concave function over a polymatroid feasible region
A new simplicial cover technique in constrained global optimization
On nonconvex optimization problems with separated nonconvex variables
Convergence qualification of adaptive partition algorithms in global optimization
Generalized bilinear programming. I: Models, applications and linear programming relaxation
Global search algorithms for minimum concave-cost network flow problems
Calculation of bounds on variables satisfying nonlinear inequality constraints
Linear multiplicative programming
Discrete solutions to engineering design problems
An exact algorithm for the concave transportation problem
A comparative analysis of linear fitting for non-linear functions on optimization. A case study: Air pollution problems
A survey of various tactics for generating Lagrangian multipliers in the context of Lagrangian duality
A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron
Solving the staircase cost facility location problem with decomposition and piecewise linearization
Decomposition based and branch and bound global optimization approaches for the phase equilibrium problem
An integer concave minimization approach for the minimum concave cost capacitated flow problem on networks
Optimal deviations from an asset allocation.
Credal networks
Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations
Domain reduction techniques for global NLP and MINLP optimization
A branch and bound algorithm for solving a class of D-C programming
Progress payments in project scheduling problems.
Subdivision of simplices relative to a cutting plane and finite concave minimization
New dual-type decomposition algorithm for non-convex separable optimization problems
The use of Hestenes' method of multipliers to resolve dual gaps in engineering system optimization
An algorithm for optimizing network flow capacity under economies of scale
Fair transfer price and inventory holding policies in two-enterprise supply chains
On the reduction of nonconvex problems of generalized semi-infinite mathematical programming to convex problems of semi-infinite programming
Construction of the convex hulls of functions for the branch-and-bound method
Deletion-by-infeasibility rule for DC-constrained global optimization
An interval branch and bound algorithm for global optimization of a multiperiod pricing model
A branch and bound network approach to the canonical constrained entropy problem
A branch-and-reduce approach to global optimization
A practical but rigorous approach to sum-of-ratios optimization in geometric applications
A branch-and-bound algorithm embedded with DCA for DC programming
Solving a class of multiplicative programs with 0-1 knapsack constraints
A combined cutting-stock and lot-sizing problem
Power-to-chemicals: a superstructure problem for sustainable syngas production
A joint decomposition method for global optimization of multiscenario nonconvex mixed-integer nonlinear programs
Convergent upper bounds in global minimization with nonlinear equality constraints
Ordering policies of a deteriorating item in an EOQ model under upstream partial order-quantity-dependent trade credit and downstream full trade credit
Optimization-based convex relaxations for nonconvex parametric systems of ordinary differential equations
A revision of the rectangular algorithm for a class of DC optimization problems
Deterministic global optimization of steam cycles using the IAPWS-IF97 model
Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets
A note on adapting methods for continuous global optimization to the discrete case
A parallel algorithm for partially separable non-convex global minimization: Linear constraints
Minimum concave-cost network flow problems: Applications, complexity, and algorithms
Separable concave minimization via partial outer approximation and branch and bound
Global optimization of nonconvex problems with multilinear intermediates
Variations and extension of the convex-concave procedure
A weighting method for 0-1 indefinite quadratic bilevel programming
Tabu search applied to the general fixed charge problem
Experiments with dynamic programming algorithms for nonseparable problems
Deterministic global optimization in ab-initio quantum chemistry
Facets of a mixed-integer bilinear covering set with bounds on variables
Global optimization of bounded factorable functions with discontinuities
Biconvex sets and optimization with biconvex functions: a survey and extensions
On the indefinite quadratic bilevel programming problem.
A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
Mean-variance portfolio optimal problem under concave transaction cost
On solving nonconvex optimization problems by reducing the duality gap
Minimal ellipsoid circumscribing a polytope defined by a system of linear inequalities
Fractional programming with convex quadratic forms and functions
Global optimization of linear hybrid systems with explicit transitions
Decomposition of mathematical programming problems by dynamic programming and its application to block-diagonal geometric programms
Discretizing dynamic programs
Sufficient optimality criterion for linearly constrained, separable concave minimization problems
Optimization of a long-short portfolio under nonconvex transaction cost
Global optimization versus integer programming in portfolio optimization under nonconvex transaction costs
Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints
Dual toll pricing for hazardous materials transport with linear delay
A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem
A fast algorithm for globally solving Tikhonov regularized total least squares problem
Strong valid inequalities for orthogonal disjunctions and bilinear covering sets
A decomposition approach for global optimum search in QP, NLP and MINLP problems
An implicit enumeration method for global optimization problems
An algorithm for indefinite integer quadratic programming
Optimization of vehicle speed for batches to minimize supply chain cost under uncertain demand
A continuous approch for globally solving linearly constrained quadratic
Reachability analysis and deterministic global optimization of DAE models
Extended reverse-convex programming: an approximate enumeration approach to global optimization
An algorithmic framework for MINLP with separable non-convexity

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)