scientific article; zbMATH DE number 3159112
From MaRDI portal
Publication:3277015
Cited in
(only showing first 100 items - show all)- An approximation-concepts approach to shape optimal design
- Enhanced methods for feasible directions for engineering design problems
- On the globalization of Wilson-type optimization methods by means of generalized reduced gradient methods
- Optimal scheduling of reservoir releases during flood: Deterministic optimization problem. I: Procedure
- Generalization of Murty's direct algorithm to linear and convex quadratic programming
- Rate of convergence of the method of feasible directions, not necessarily using the direction of steepest descent
- Partitioning procedures for solving mixed-variables programming problems
- A geometrie representation for pairs of dual quadratic or linear programs
- An efficient curvilinear method for the minimization of a nonlinear function subject to linear inequality constraints
- Observations on a class of nasty linear complementarity problems
- Feasible direction method for large-scale nonconvex programs: Decomposition approach
- A globally convergent, implementable multiplier method with automatic penalty limitation
- Distributed-parameter optimal control via mathematical programming
- A cutting-plane algorithm with linear and geometric rates of convergence
- New convergence theorems for a class of feasible directions algorithms
- An algorithm for linearly constrained nonlinear programming problems
- A new solution to optimization-satisfaction problems by a penalty method
- Numerical study of some feasible direction methods in mathematical programming
- Method of reduction in convex programming
- Algorithm model for penalty functions-type iterative pcedures
- Decentralized optimization for distributed-lag models of discrete systems
- On the rate of convergence of some feasible direction algorithms
- On the removal of ill conditioning effects in the computation of optimal controls
- A systematic approach to the synthesis of algorithms
- A convergence theory for a class of anti-jamming strategies
- A conjugate direction algorithm without line searches
- Approximation methods for the unconstrained optimization
- An accelerated conjugate direction method to solve linearly constrained minimization problems
- Accelerated conjugate direction methods for unconstrained optimization
- Feasible directions in economic policy
- An algorithm for minimizing a differentiable function subject to box constraints and errors
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- A geometric method in nonlinear programming
- The Topkis-Veinott algorithm for solving nonlinear programs with lower and upper bounded variables
- Algorithms for a class of computer-aided design problems: A review
- Global convergence analysis of algorithms for finding feasible points in norm-relaxed MFD
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization
- A generalization of the norm-relaxed method of feasible directions
- The relationship between theorems of the alternative, least norm problems, steepest descent directions, and degeneracy: A review
- Convergence analysis of norm-relaxed method of feasible directions
- Self-tuning norm-relaxed method of feasible directions
- Optimal elastic design of trusses by feasible direction methods
- Evaluating jointly constrained order quantity complexities for incremental discounts.
- A new SQP method of feasible directions for nonlinear programming.
- Parameter detection of thin films from their X-ray reflectivity by support vector machines.
- Optimization over the efficient set of a parametric multiple objective linear programming problem
- A decomposition method for large-scale box constrained optimization
- An accurate method for real-time aircraft dynamics simulation based on predictor-corrector scheme
- An efficient sequential quadratic programming algorithm for nonlinear programming
- A feasible interior-point algorithm for nonconvex nonlinear programming
- Computational methods for optimum design of large complex systems
- A feasible conjugate direction method to solve linearly constrained minimization problems
- First-order strong variation algorithms for optimal control problems with terminal inequality constraints
- Probabilistic version of the method of feasible directions.
- Shape design sensitivity analysis with respect to the positioning of features in composite structures using the boundary element method
- Vertex assigned morphing for parameter free shape optimization of 3-dimensional solid structures
- Analysis of equal-share and equalized flow distribution at the peak load in the multiuser network
- Finding second-order stationary points in constrained minimization: a feasible direction approach
- Simple sequential quadratically constrained quadratic programming feasible algorithm with active identification sets for constrained minimax problems
- Mathematical model and efficient algorithms for object packing problem
- Optimal packings for filled rings of circles.
- Necessary and sufficient conditions for emptiness of the cones of generalized support vectors
- Nonlinear goal programming theory and practice: A survey
- New sequential quadratically-constrained quadratic programming method of feasible directions and its convergence rate
- Modified combined relaxation method for general monotone equilibrium problems in Hilbert spaces
- Feasible generalized monotone line search SQP algorithm for nonlinear minimax problems with inequality constraints
- Pivoting in linear complementarity: Two polynomial-time cases
- A new method for solving conditioned maxima problems
- A sequential quadratically constrained quadratic programming method of feasible directions
- A new superlinearly convergent algorithm of combining QP subproblem with system of linear equations for nonlinear optimization
- Algorithms for some minimax problems
- On variable-metric algorithms
- Structural weight minimization using necessary and sufficient conditions
- Some representation theorems for functions and sets and their application to nonlinear programming
- On error bounds of approximate solutions by means of variational methods and duality theory
- Projection method for unconstrained optimization
- Cutting plane algorithms and state space constrained linear optimal control problems
- A method of feasible directions using function approximations, with applications to min max problems
- A modified gradient method for finite element elastoplastic analysis by quadratic programming
- Optimizing functional in combined controls of dynamic plants
- Optimization of Space Station components using design code CometBoards
- A new norm-relaxed method of strongly sub-feasible direction for inequality constrained optimization
- Optimal quantization of the support of a continuous multivariate distribution based on mutual information
- Analysis of the load distribution and internodal flows under different routing strategies in a multiuser network
- Estimate of resource distribution with the shortest paths in the multiuser network
- Supervised Learning by Support Vector Machines
- Characterizations of optimality in convex programming: the nondifferentiable case
- Dual finite element analysis for unilateral boundary value problems
- Ein lineares Programmierungsverfahren
- An algorithm for constrained convex optimization
- A New Superlinearly Convergent Strongly Subfeasible Sequential Quadratic Programming Algorithm for Inequality-Constrained Optimization
- Nonsmooth optimization
- A non-linear programming approach to the computer-aided design of regulators using a linear-quadratic formulation†
- Verfahren der zulässigen riehtungeh unter rexmtzung reduzierter gradienten für niehtllneare optimierungsprobleme
- scientific article; zbMATH DE number 3963115 (Why is no real title available?)
- A hybrid method fur linearly constrained optimisation problems
- A two-stage feasible directions algorithm for nonlinear constrained optimization
- An algorithm for non-negative norm minimal solutions
- Sensitivity analysis of optimum solutions by updating active constraints: application in aircraft structural design
- Rational approximation of empirical functions
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 Q3277015)