Variations and extension of the convex-concave procedure (Q2358020): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 04:44, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	Variations and extension of the convex-concave procedure	scientific article

Statements

scholarly article

0 references

Variations and extension of the convex-concave procedure (English)

0 references

0 references

Stephen P. Boyd

0 references

Optimization and Engineering

0 references

publication date

20 June 2017

0 references

zbMATH Keywords

convex optimization

0 references

convex concave procedure

0 references

sequential optimization

0 references

difference of convex programming

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s11081-015-9294-x

0 references

0 references

A sequential parametric convex approximation method with applications to nonconvex truss topology design problems

0 references

Laplacian Eigenmaps for Dimensionality Reduction and Data Representation

0 references

0 references

0 references

MIMO PID tuning via iterated LMI restriction

0 references

A trust region method based on interior point techniques for nonlinear programming.

0 references

Block-iterative interior point optimization methods for image reconstruction from limited data

0 references

Experimental results on the crossover point in random 3-SAT

0 references

DC Programming Approaches for BMI and QMI Feasibility Problems

0 references

0 references

0 references

Exact Penalty Functions in Constrained Optimization

0 references

CVXPY: A Python-Embedded Modeling Language for Convex Optimization

0 references

Convergent Algorithms for Minimizing a Concave Function

0 references

Stabilized column generation

0 references

The Geometry of Algorithms with Orthogonality Constraints

0 references

A central cutting plane algorithm for the convex programming problem

0 references

A Successive Underestimation Method for Concave Minimization Problems

0 references

An Algorithm for Separable Nonconvex Programming Problems

0 references

Design of Optimal Sparse Feedback Gains via the Alternating Direction Method of Multipliers

0 references

Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems

0 references

Sequential Quadratic Programming Methods

0 references

Graph Implementations for Nonsmooth Convex Programs

0 references

Exact penalty functions in nonlinear programming

0 references

On functions representable as a difference of convex functions

0 references

Optimization Problems Subject to a Budget Constraint with Economies of Scale

0 references

Linear programs with an additional reverse convex constraint

0 references

Reverse convex programming

0 references

A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization

0 references

DC programming: overview.

0 references

0 references

On solving a d.c. programming problem by a sequence of linear programs

0 references

Concave minimization via conical partitions and polyhedral outer approximation

0 references

Introduction to global optimization

0 references

The Cutting-Plane Method for Solving Convex Programs

0 references

0 references

Branch-and-Bound Methods: A Survey

0 references

A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography

0 references

Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

0 references

Solving a class of linearly constrained indefinite quadratic problems by DC algorithms

0 references

Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach

0 references

A continuous approach for the concave cost supply problem via DC programming and DCA

0 references

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

0 references

A combined d.c. optimization--ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems

0 references

Combination between global and local methods for solving an optimization problem over the efficient set

0 references

DC programming approach for portfolio optimization under step increasing transaction costs

0 references

DC programming techniques for solving a class of nonlinear bilevel programs

0 references

Exact penalty and error bounds in DC programming

0 references

DC Programming and DCA for General DC Programs

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

0 references

0 references

The Validity of a Family of Optimization Methods

0 references

A quadratically-convergent algorithm for general nonlinear programming problems

0 references

0 references

Cutting-set methods for robust convex optimization with pessimizing oracles

0 references

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

0 references

0 references

Combining DCA (DC Algorithms) and interior point techniques for large-scale nonconvex quadratic programming

0 references

An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs

0 references

0 references

An Algorithm for Separable Nonconvex Programming Problems II: Nonconvex Constraints

0 references

Richtungsfelder und Fernparallelismus in \(n\)-dimensionalen Mannigfaltigkeiten

0 references

The method of moving asymptotes—a new method for structural optimization

0 references

SDPT3 — A Matlab software package for semidefinite programming, Version 1.3

0 references

Solving semidefinite-quadratic-linear programs using SDPT3

0 references

On outer approximation methods for solving concave minimization problems

0 references

0 references

Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems

0 references

Inner approximation method for a reverse convex programming problem

0 references

The Concave-Convex Procedure

0 references

0 references

Global convergence of a nonlinear programming method using convex approximations

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

10.1007/S11081-015-9294-X

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2358020

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2358020&oldid=39032289"