Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints

DOI10.1287/OPRE.24.4.643MaRDI QIDQ4117584zbMATH OpenOpenAlexFDO

Authors Richard E. Wendell, Arthur P. jun. Hurter

Publication date 1976

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.24.4.643

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited in

(23)

• Generalized bilinear programming: An application in farm management
• A penalty function approach for solving bi-level linear programs
• Minimum spanning trees with neighborhoods: mathematical programming formulations and solution methods
• Clustering with missing features: a penalized dissimilarity measure based approach
• Global optimization for the biaffine matrix inequality problem
• Regularized joint estimation of related vector autoregressive models
• Piecewise convexity of artificial neural networks
• Biconvex sets and optimization with biconvex functions: a survey and extensions
• Electricity swing option pricing by stochastic bilevel optimization: a survey and new approaches
• Optimization of linear-convex programs
• Computing Feasible Points of Bilevel Problems with a Penalty Alternating Direction Method
• ADJUST: a dictionary-based joint reconstruction and unmixing method for spectral tomography
• An Alternating Method for Cardinality-Constrained Optimization: A Computational Study for the Best Subset Selection and Sparse Portfolio Problems
• Penalty alternating direction methods for mixed-integer optimization: a new view on feasibility pumps
• Improvement of the LMI change of variables for multi-objective control design problems
• Supervised-distributed control with joint performance and communication optimisation
• Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
• A multi-granularity locally optimal prototype-based approach for classification
• Robustification of the k-means clustering problem and tailored decomposition methods: when more conservative means more accurate
• Mixed-integer bilinear programming problems
• Distorted expectiles risk measure and LP formulation
• Inverse optimization in semi-definite programs to impute unknown constraint matrices
• Jointly constrained bilinear programs and related problems: An overview

This page was built for publication: Minimization of a Non-Separable Objective Function Subject to Disjoint Constraints

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