scientific article; zbMATH DE number 417962
From MaRDI portal
Publication:3134873
Quadratic programming (90C20) Fractional programming (90C32) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)
Cited in
(only showing first 100 items - show all)- A Family of Model Predictive Control Algorithms With Artificial Neural Networks
- An interactive approach to improve estimates of value efficiency in data envelopment analysis.
- Searching for joint gains in multi-party negotiations.
- Optimal expansions of discrete-time Volterra models using Laguerre functions
- An efficient method for optimal correcting of absolute value equations by minimal changes in the right hand side
- An \(\varepsilon\)-accurate model for optimal unequal-area block layout design
- Competitive newsvendor problems with the same Nash and Stackelberg solutions
- A new neural network for solving nonlinear projection equations
- Generalized semi-infinite programming: a tutorial
- On the best rank-1 approximation to higher-order symmetric tensors
- Production and inventory management under multiple resource constraints
- Open and closed loop Nash equilibria in games with a continuum of players
- Wald one-sided test using generalized estimating equations approach
- Constraint proposal method for computing Pareto solutions in multi-party negotiations
- On mixed-integer zero-one representations for separable lower-semicontinuous piecewise-linear functions
- Scalable TFETI with optional preconditioning by conjugate projector for transient frictionless contact problems of elasticity
- A dynamical model for solving degenerate quadratic minimax problems with constraints
- Locating collection centers for incentive-dependent returns under a pick-up policy with capacitated vehicles
- The relevance of DEA benchmarking information and the least-distance measure: comment
- Topology optimization of flow networks.
- Interior proximal algorithm for quasiconvex programming problems and variational inequalities with linear constraints
- On improving normal boundary intersection method for generation of Pareto frontier
- A new approach to solid modeling with trivariate T-splines based on mesh optimization
- Nonconvex generalized Benders decomposition for stochastic separable mixed-integer nonlinear programs
- Combined forecasts in portfolio optimization: a generalized approach
- Supply chain networks with global outsourcing and quick-response production under demand and cost uncertainty
- A stochastic quasi-Newton method for simulation response optimization
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- First order optimality conditions for generalized semi-infinite programming problems
- A feedback neural network for solving convex constraint optimization problems
- Reverse bullwhip effect in pricing
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Stationary conditions for mathematical programs with vanishing constraints using weak constraint qualifications
- Pricing surplus server capacity for mean waiting time sensitive customers
- Two new algorithms for UMTS access network topology design
- Dynamics of supply chain networks with corporate social responsibility through integrated environmental decision-making
- Joint optimization for area traffic control and network flow
- Sourcing decisions with capacity reservation contracts
- Identifying the anchor points in DEA using sensitivity analysis in linear programming
- Gradient consistency for integral-convolution smoothing functions
- Duality for optimization problems in Banach algebras
- An extension of proximal methods for quasiconvex minimization on the nonnegative orthant
- A self-adaptive projection and contraction algorithm for the traffic assignment problem with path-specific costs
- A simplified recurrent neural network for pseudoconvex optimization subject to linear equality constraints
- Classifying compact convex sets with frames
- Parametric free-form shape design with PDE models and reduced basis method
- Decision-aid for discrete multiple criteria decision making problems with imprecise data
- Decentralized method for computing Pareto solutions in multiparty negotiations
- Competitive facility location on decentralized supply chains
- Model development and optimization for space engineering: concepts, tools, applications, and perspectives
- Generating equidistant representations in biobjective programming
- Capacity reservation under supply uncertainty
- Convergence and computational analyses for some variable target value and subgradient deflection methods
- Efficient algorithms for combined heat and power production planning under the deregulated electricity market
- Column Generation Algorithms for Nonlinear Optimization, I: Convergence Analysis
- Multi-item spare parts systems with lateral transshipments and waiting time constraints
- On a basic definition of returns to scale
- A dynamic system model for solving convex nonlinear optimization problems
- Semiparametric binary regression models under shape constraints with an application to Indian schooling data
- Solving stochastic complementarity problems in energy market modeling using scenario reduction
- Improvements by analyzing the efficient frontier in DEA
- Economic selection of process mean for single-vendor single-buyer supply chain
- An inexact proximal method for quasiconvex minimization
- Continuous \((s,S)\) policy with MMPP correlated demand
- Analysis of the constraint proposal method for two-party negotiations
- Characterization of nonsmooth quasiconvex and pseudoconvex functions
- Impacts of inventory shortage policies on transportation requirements in two-stage distribution systems
- Economic statistical design of adaptive control schemes for monitoring the mean and variance: An application to analyzers
- KKT optimality conditions in interval valued multiobjective programming with generalized differentiable functions
- Feasible method for generalized semi-infinite programming
- Monotonicity and market equilibrium
- Optimality conditions for nonsmooth equilibrium problems via Hadamard directional derivative
- A practical nonlinear dynamic framework for solving a class of fractional programming problems
- Gauss-Seidel-type methods for energy states of a multi-component Bose-Einstein condensate
- On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
- scientific article; zbMATH DE number 2046035 (Why is no real title available?)
- A continuous bi-level model for the expansion of highway networks
- Emergency railway wagon scheduling by hybrid biogeography-based optimization
- Solving the unit commitment problem by a unit decommitment method
- Quadratic resource allocation with generalized upper bounds
- Properties and methods for finding the best rank-one approximation to higher-order tensors
- A theoretically supported scalable TFETI algorithm for the solution of multibody 3D contact problems with friction
- \(\text{CO}_{2} \) emissions trading planning in combined heat and power production via multi-period stochastic optimization
- Supplier selection and procurement decisions with uncertain demand, fixed selection costs and quantity discounts
- Approximate dynamic programming via direct search in the space of value function approximations
- A new neural network for solving quadratic programming problems with equality and inequality constraints
- Using integer programming for balancing return and risk in problems with individual chance constraints
- Managing electricity market price risk
- A heuristic for the OD matrix adjustment problem in a congested transport network
- Optimal quantization for the one-dimensional uniform distribution with Rényi-\(\alpha \)-entropy constraints
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Novel artificial neural network with simulation aspects for solving linear and quadratic programming problems
- On second-order optimality conditions for vector optimization
- Hybrid extreme point tabu search
- Pivot versus interior point methods: Pros and cons
- Successive smoothing algorithm for solving large-scale optimization models with fixed cost
- Distance to ill-posedness and the consistency value of linear semi-infinite inequality systems
- The monoclus of a coalitional game
- Some algebraic methods for solving multiobjective polynomial integer programs
- An appraisal of some aspects of statistical inference under inequality constraints
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3134873)