On Nonlinear Fractional Programming
From MaRDI portal
Cited in
(only showing first 100 items - show all)- A single-loop proximal subgradient algorithm for A class structured fractional programs
- On low-rank convex-convex quadratic fractional programming
- Portfolio optimization with performance ratios
- Saddle points and Lagrangian-type duality for discrete minmax fractional subset programming problems with generalized convex functions
- Symmetric Dual Continuous Fractional Programming
- Generalized fractional programming duality: A parametric approach
- Efficient local search procedures for quadratic fractional programming problems
- Globally maximizing the ratio of two generalized quadratic matrix form functions over the Stiefel manifold
- What is quasiconvex analysis?
- Structural and algorithmic properties for parametric minimum cuts
- Proximal-type methods with generalized Bregman functions and applications to generalized fractional programming
- A Mixed-Integer Fractional Optimization Approach to Best Subset Selection
- Rate of convergence of a generalization of Newton's method
- Graph algorithm based submodular function for sparsest cut problem
- Farkas-type results for fractional programming problems
- A new algorithm for generalized fractional programs
- An exact method for optimizing a quadratic function over the efficient set of multiobjective integer linear fractional program
- On box-constrained total least squares problem
- An effective computational algorithm for the global solution of a class of linear fractional programming
- Parametric approach to quadratically constrained multi-level multi-objective quadratic fractional programming
- Computing an upper bound on contact stress with surrogate duality
- Generating eigenvalue bounds using optimization
- Discrete Newton methods for the evacuation problem
- Total least squares problems on infinite dimensional spaces
- Method of centers for generalized fractional programming
- Symmetric Duality with Invexity in Static and Continuous Fractional Programming
- A global optimization approach to fractional optimal control
- Estimating average treatment effects with support vector machines
- Stochastic fractional programming approach to a mean and variance model of a transportation problem
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- Transportation technique in non-linear fractional programming
- Mixed type duality in multiobjective fractional programming under generalized \(\rho\)-univex function
- Fractional programming
- Optimality conditions for multiple objective fractional subset programming with \((\rho,\sigma,\theta )\)-type-I and related non-convex functions
- Optimality criteria for fuzzy-valued fractional multi-objective optimization problem
- On solving the sum-of-ratios problem
- An equivalent fractional optimization problem under invexity conditions for solving fractional vector variational-like inequality problems to portfolio optimization in finance
- Optimal performance of LTI systems over power constrained erasure channels
- Interval division and linearization algorithm for minimax linear fractional program
- Sum-of-squares relaxations in robust DC optimization and feature selection
- A simple iterative algorithm for maxcut
- Designing experiments toward shrinkage estimation
- Inertial Proximal Block Coordinate Method for a Class of Nonsmooth Sum-of-Ratios Optimization Problems
- An inertial subgradient-extragradient algorithm for solving pseudomonotone variational inequalities
- Global Nonparametric Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Involving Generalized (η, ρ)-Invex Functions
- Sequential approximate optimality conditions for a constrained convex vector minimization problem and application to multiobjective fractional programming problem
- Optimizing a linear fractional function over the integer efficient set
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs
- Improving graph partitions using submodular functions.
- Duality for a properly efficient solution of bilevel multiobjective fractional programming problems with extremal-value function
- Non-differentiable vector programming problem and duality for higher-order cone convex functions
- Exact and heuristic algorithms for cardinality-constrained assortment optimization problem under the cross-nested logit model
- scientific article; zbMATH DE number 7317464 (Why is no real title available?)
- Power control and channel allocation algorithm for energy harvesting D2D communications
- A doubly nonnegative relaxation for modularity density maximization
- Data clustering based on the modified relaxation Cheeger cut model
- An outcome-space-based branch-and-bound algorithm for a class of sum-of-fractions problems
- Optimal selection of forest patches using integer and fractional programming
- A Bregman proximal subgradient algorithm for nonconvex and nonsmooth fractional optimization problems
- A convex optimization approach for minimizing the ratio of indefinite quadratic functions over an ellipsoid
- A paradox in linear fractional transportation problems with mixed constraints
- On Sufficient Optimality Conditions for Semi-Infinite Discrete Minmax Fractional Programming Problems Under Generalized V-Invexity
- Pareto optimality conditions and duality for vector quadratic fractional optimization problems
- Nondifferentiable fractional semi-infinite multiobjective optimization problems
- On quality concepts fractional programming
- Fractional optimization problems
- Feature selection with SVD entropy: some modification and extension
- Optimal scaling by alternating length-constrained nonnegative least squares, with application to distance-based analysis
- Fractional programming
- A note on fractional interval programming
- Supervised dimensionality reduction via distance correlation maximization
- Robust optimality conditions and duality for nonsmooth multiobjective fractional semi-infinite programming problems with uncertain data
- Fractional 0-1 programming: applications and algorithms
- Dual method of centers for solving generalized fractional programs
- Partial linearization for generalized fractional programming
- Approximate Farkas lemma and approximate duality for fractional optimization problems
- Parametric approaches to fractional programs
- Integer quadratic fractional programming problems with bounded variables
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Solving fractional multicriteria optimization problems with sum of squares convex polynomial data
- Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
- Formulas for sequential Pareto subdifferentials of the sums of vector mappings and applications to optimality conditions
- Fractional Programming — Some Recent Developments
- Comparison between different duals in multiobjective fractional programming
- Duality Theorems for Non‐Linear Fractional Programs
- scientific article; zbMATH DE number 7547157 (Why is no real title available?)
- Solving a class of feature selection problems via fractional 0--1 programming
- Efficiently solving total least squares with Tikhonov identical regularization
- Convex optimization approaches to maximally predictable portfolio selection
- Optimality conditions and duality models for a class of nonsmooth constrained fractional optimal control problems
- Applications of the proximal difference-of-convex algorithm with extrapolation in optimal correction
- Duality in nonlinear fractional programming
- Fuzzy decision making for fuzzy random multiobjective linear programming problems with variance covariance matrices
- Solving a type of the Tikhonov regularization of the total least squares by a new s-lemma
- The principle and models of dynamic programming. II
- The principle and models of dynamic programming. III
- C-programming and the minimization of pseudolinear and additive concave functions
- Efficient solutions of interval programming problems with inexact parameters and second order cone constraints
- The principle and models of dynamic programming. V
- A modified objective function method for solving nonlinear multiobjective fractional programming problems
This page was built for publication: On Nonlinear Fractional Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5531569)